1 Generators  

Generator和list comprehension非常类似

Generators are a kind of iterator that are defined like functions.

http://www.codeskulptor.org/#examples_generators.py

https://wiki.python.org/moin/Generators

generater function的函数体中必须写上yield, 能够写或者不写return。



Generators functions allow you to declare a function that behaves like an iterator, i.e. it can be used in a for loop.

Each time the next(), method is applied to the resulting generator, the code is run until the next yield expression, and the yield expression's value is returned from that method call. Thus, the creation of the
generator does not wait for all of its elements to be generator, and the generator could even represent an infinite number of elements.

# A list comprehension
print "max in list:", max([num * 2 - 3 for num in range(7)]) # A generator expression
print "max in gen:", max(num * 2 - 3 for num in range(7)) # A generator function
def genfunc(limit):
num = 0
while num < limit:
yield num #generator function一般和iteration搭配使用。yield说明这个值产生了,放在一边,如今循环继续进行。等循环结束了。再回来处理之前yield产生的值。
num = num + 1 print genfunc(7)
# Iteration using a generator function
print "Iterate over generator:"
for number in genfunc(7):
print number

2 stack and queue

stack http://www.codeskulptor.org/#user36_ZHLkI0d7kb_2.py

queue  http://www.codeskulptor.org/#user35_AtoP6ttM6w_0.py

3 inheritance

http://www.codeskulptor.org/#examples_inheritance.py

http://www.codeskulptor.org/#examples_inheritance2.py





4 grid collision

http://www.codeskulptor.org/#poc_physics_quadratic.py

https://class.coursera.org/principlescomputing-001/wiki/view?

page=fun_growth

https://class.coursera.org/principlescomputing-001/wiki/view?page=grids

5 grid类的实现  

http://www.codeskulptor.org/#poc_grid.py 

注意当中的”def get_index(self, point, cell_size):”的转化方法。把实际的screen position转化为了index



6 Conway’s game of life 模拟

game of life 简单介绍 http://en.wikipedia.org/wiki/Conway's_Game_of_Life

game of life 进行grid操作的练习 http://www.codeskulptor.org/#poc_gol_student.py



7 BFS

BFS动画 野火烧不尽 春风吹又生 

http://www.codeskulptor.org/#poc_wildfire_student.py

http://www.codeskulptor.org/#poc_wildfire_gui.py

http://www.codeskulptor.org/#poc_grid.py

BFS原理 https://class.coursera.org/principlescomputing-001/wiki/view?page=bfs



8 grid的用途 使用bucket sorting进行string sorting

https://class.coursera.org/principlescomputing-001/wiki/view?page=strings

http://www.codeskulptor.org/#poc_string_sort.py

# 产生26个字母组成的list

list= [ chr(ord("a") + char_num) for char_num in range(26)]

print list





9 stack and queue

老师实现的queue http://www.codeskulptor.org/#poc_queue.py

自己实现的stackhttp://www.codeskulptor.org/#user36_ZHLkI0d7kb_2.py



10 Zombie Apocalypse

http://www.codeskulptor.org/#poc_zombie_template.py

1)  Passable cells in the grid correspond to EMPTY cells while FULL cells are impassable

2)  However, several humans and zombies may inhabit the same grid cell.

3) 注意用for each in list1仅仅能读取list1中的元素,不能改动list1中的元素,假设要改动的话。要使用下标操作,如

4) zombie和human移动的原理是这种。

首先对zombie计算一个distance_grid,这个distance_grid中的每一个cell都表达从当前cell到距离近期的一个zombie的距离,接下来,move_human的时候,就从human周围的cell中选一个distance_grid相应值最大的cell,这样human 就移动到了一个human最安全的点。

类似。对human计算一个distance_grid。中的每一个cell都表达从当前cell到距离近期的一个human的距离,接下来,move_zombie的时候,就从zombie周围的cell中选一个distance_grid相应值最小的cell,这样human
就移动到了一个最接近human的点。

5) 题目做了非常多简化。

比方计算distance_grid的时候。无论是zombie还是human。都假定当前cell的相邻cell仅仅有4个,而不是8个。

当zombie追上human的时候,仅仅是grid改变了颜色,假设下一步继续human move,human还是活着的。

for idx in range(len(list1)):
list1[idx] += 1

我的作业

"""
Student portion of Zombie Apocalypse mini-project
""" import random
import poc_grid
import poc_queue
import poc_zombie_gui # global constants
EMPTY = 0
FULL = 1
FOUR_WAY = 0
EIGHT_WAY = 1
OBSTACLE = "obstacle"
HUMAN = "human"
ZOMBIE = "zombie" class Zombie(poc_grid.Grid):
"""
Class for simulating zombie pursuit of human on grid with
obstacles
""" def __init__(self, grid_height, grid_width, obstacle_list = None,
zombie_list = None, human_list = None):
"""
Create a simulation of given size with given obstacles,
humans, and zombies
"""
poc_grid.Grid.__init__(self, grid_height, grid_width)
if obstacle_list != None:
for cell in obstacle_list:
self.set_full(cell[0], cell[1])
if zombie_list != None:
self._zombie_list = list(zombie_list)
else:
self._zombie_list = []
if human_list != None:
self._human_list = list(human_list)
else:
self._human_list = [] def clear(self):
"""
Set cells in obstacle grid to be empty
Reset zombie and human lists to be empty
"""
poc_grid.Grid.clear(self)
self._zombie_list = []
self._human_list = [] def add_zombie(self, row, col):
"""
Add zombie to the zombie list
"""
self._zombie_list.append((row,col)) def num_zombies(self):
"""
Return number of zombies
"""
return len(self._zombie_list) def zombies(self):
"""
Generator that yields the zombies in the order they were
added.
"""
num = 0
while num < self.num_zombies():
yield self._zombie_list[num]
num += 1
return def add_human(self, row, col):
"""
Add human to the human list
"""
self._human_list.append((row,col)) def num_humans(self):
"""
Return number of humans
"""
return len(self._human_list) def humans(self):
"""
Generator that yields the humans in the order they were added.
"""
num = 0
while num<self.num_humans():
yield self._human_list[num]
num += 1
return def compute_distance_field(self, entity_type):
"""
Function computes a 2D distance field
Distance at member of entity_queue is zero
Shortest paths avoid obstacles and use distance_type distances
"""
visited = poc_grid.Grid(self._grid_height, self._grid_width)
distance_field = [[ self._grid_width * self._grid_height for dummy_col in range(self._grid_width)]
for dummy_row in range(self._grid_height)]
if entity_type == HUMAN:
boundary = poc_queue.Queue()
for each in self._human_list:
visited.set_full(each[0],each[1])
distance_field[each[0]][each[1]] = 0
boundary.enqueue(each)
while len(boundary)>0:
cur_cell = boundary.dequeue()
four_neighbors = poc_grid.Grid.four_neighbors(self,cur_cell[0],cur_cell[1])
for each_neighbor in four_neighbors:
if visited.is_empty(each_neighbor[0],each_neighbor[1]) and poc_grid.Grid.is_empty(self, each_neighbor[0], each_neighbor[1]) :
visited.set_full(each_neighbor[0],each_neighbor[1])
if distance_field[cur_cell[0]][cur_cell[1]]+1 < distance_field[each_neighbor[0]][ each_neighbor[1]]:
distance_field[each_neighbor[0]][ each_neighbor[1]] = distance_field[cur_cell[0]][cur_cell[1]]+1
boundary.enqueue(each_neighbor)
elif entity_type == ZOMBIE:
boundary = poc_queue.Queue()
for each in self._zombie_list:
visited.set_full(each[0],each[1])
distance_field[each[0]][each[1]] = 0
boundary.enqueue(each)
while len(boundary)>0:
cur_cell = boundary.dequeue()
four_neighbors = poc_grid.Grid.four_neighbors(self,cur_cell[0],cur_cell[1])
for each_neighbor in four_neighbors:
if visited.is_empty(each_neighbor[0],each_neighbor[1]) and poc_grid.Grid.is_empty(self, each_neighbor[0], each_neighbor[1]):
visited.set_full(each_neighbor[0],each_neighbor[1])
if distance_field[cur_cell[0]][cur_cell[1]]+1 < distance_field[each_neighbor[0]][ each_neighbor[1]]:
distance_field[each_neighbor[0]][ each_neighbor[1]] = distance_field[cur_cell[0]][cur_cell[1]]+1
boundary.enqueue(each_neighbor)
return distance_field def move_humans(self, zombie_distance):
"""
Function that moves humans away from zombies, diagonal moves
are allowed
"""
for idx in range(len(self._human_list)):
eight_neighbor_human = poc_grid.Grid.eight_neighbors(self, self._human_list[idx][0],self._human_list[idx][1])
max_distance = zombie_distance[self._human_list[idx][0]][self._human_list[idx][1]]
max_pos =(self._human_list[idx][0],self._human_list[idx][1])
for eight_neighbor in eight_neighbor_human:
if zombie_distance[eight_neighbor[0]][eight_neighbor[1]]> max_distance:
max_distance = zombie_distance[eight_neighbor[0]][eight_neighbor[1]]
max_pos =(eight_neighbor[0],eight_neighbor[1])
self._human_list[idx]=(max_pos[0],max_pos[1]) def move_zombies(self, human_distance):
"""
Function that moves zombies towards humans, no diagonal moves
are allowed
"""
for idx in range(len(self._zombie_list)):
four_neighbor_zombie = poc_grid.Grid.four_neighbors(self, self._zombie_list[idx][0],self._zombie_list[idx][1])
min_distance = human_distance[self._zombie_list[idx][0]][self._zombie_list[idx][1]]
min_pos =(self._zombie_list[idx][0],self._zombie_list[idx][1])
for four_neighbor in four_neighbor_zombie:
if human_distance[four_neighbor[0]][four_neighbor[1]]< min_distance:
min_distance = human_distance[four_neighbor[0]][four_neighbor[1]]
min_pos =(four_neighbor[0],four_neighbor[1])
self._zombie_list[idx]=(min_pos[0],min_pos[1]) # Start up gui for simulation - You will need to write some code above
# before this will work without errors
#test_zombie = Zombie(3, 3, [], [], [(2, 2)])
#print test_zombie.compute_distance_field('human')
poc_zombie_gui.run_gui(Zombie(20, 15))

Principle of Computing (Python)学习笔记(5) BFS Searching + Zombie Apocalypse的更多相关文章

  1. Principle of Computing (Python)学习笔记(7) DFS Search + Tic Tac Toe use MiniMax Stratedy

    1. Trees Tree is a recursive structure. 1.1 math nodes https://class.coursera.org/principlescomputin ...

  2. OpenCV之Python学习笔记

    OpenCV之Python学习笔记 直都在用Python+OpenCV做一些算法的原型.本来想留下发布一些文章的,可是整理一下就有点无奈了,都是写零散不成系统的小片段.现在看 到一本国外的新书< ...

  3. python学习笔记整理——字典

    python学习笔记整理 数据结构--字典 无序的 {键:值} 对集合 用于查询的方法 len(d) Return the number of items in the dictionary d. 返 ...

  4. VS2013中Python学习笔记[Django Web的第一个网页]

    前言 前面我简单介绍了Python的Hello World.看到有人问我搞搞Python的Web,一时兴起,就来试试看. 第一篇 VS2013中Python学习笔记[环境搭建] 简单介绍Python环 ...

  5. python学习笔记之module &amp;&amp; package

    个人总结: import module,module就是文件名,导入那个python文件 import package,package就是一个文件夹,导入的文件夹下有一个__init__.py的文件, ...

  6. python学习笔记(六)文件夹遍历,异常处理

    python学习笔记(六) 文件夹遍历 1.递归遍历 import os allfile = [] def dirList(path): filelist = os.listdir(path) for ...

  7. python学习笔记--Django入门四 管理站点--二

    接上一节  python学习笔记--Django入门四 管理站点 设置字段可选 编辑Book模块在email字段上加上blank=True,指定email字段为可选,代码如下: class Autho ...

  8. python学习笔记--Django入门0 安装dangjo

    经过这几天的折腾,经历了Django的各种报错,翻译的内容虽然不错,但是与实际的版本有差别,会出现各种奇葩的错误.现在终于找到了解决方法:查看英文原版内容:http://djangobook.com/ ...

  9. python学习笔记(一)元组,序列,字典

    python学习笔记(一)元组,序列,字典

随机推荐

  1. tn文本分析语言(四) 实现自然语言计算器

    tn是desert和tan共同开发的一种用于匹配,转写和抽取文本的语言.解释器使用Python实现,代码不超过1000行. github地址:https://github.com/ferventdes ...

  2. Redis性能测试

    Redis 性能测试 Redis 性能测试是通过同时执行多个命令实现的.Redis性能测试主要是通过src文件夹下的redis-benchmark来实现(Linux系统下) 语法 redis 性能测试 ...

  3. 批量删除wordpress垃圾评论留言

    wordpress博客的存在,垃圾评论注定会找上门来.大家还可以用Akismet.Bad Behavior.Spam Karma等一些其他的插件或者直接用程序写个验证码函数对留言进行验证来过滤 垃圾评 ...

  4. liunx环境下的mysql数据库配置文件my.conf内的参数含义

    [client]port = 3306socket = /tmp/mysql.sock [mysqld]port = 3306socket = /tmp/mysql.sock basedir = /u ...

  5. DevExpress之进度条

    progressBarControl和marqueeProgressBarControl 一.progressBarControl progressBarControl是一个进度条控件 几个重要参数 ...

  6. Java面试题复习笔记(数据库)

    1.数据库分类? 关系型数据库和非关系型. 常用关系型:Myspl.Oracle.SQLServer 非关系型:Redis.Hadoop.Memcache.Mogobd 2.关系数据库三范式? 范式就 ...

  7. 在eclipse总是会运行之前的错误项目

    我改了context root没有用,删了work下面的项目文件也没有用,最后必须要改server的配置,就是在windows下有个server runtimeEnvironment http://b ...

  8. java == 与 equals 相同与不同点

    java中与很多有意思又值得深究的点. 写这篇文章呢,是由于在百度知道中看到一个问题:怎样比较两个对象是否相同.这又使我想到了另外一个问题,== 和 equals有什么不同?写了几行代码,看了几篇文章 ...

  9. English trip M1 - AC3 Teacher:Corrine

    课堂上内容 16,black,games The clothes is Only $. is lucky number in China. God give us black eyes,but we ...

  10. MaintainableCSS 《可维护性 CSS》 --- 约定篇

    约定 可维护的CSS具有以下约定: .<module>[-<component>][-<state>] {} 根据所讨论的模块,方括号是可选的.这里有些例子: /* ...