Jar*_*ach 1 python conways-game-of-life
我被分配了这个项目，说明如下：
生命游戏是为无限大小的网格定义的。在第 2 章中，我们将 Life Grid ADT 定义为使用固定大小的网格，其中用户指定网格的宽度和高度。这足以说明如何使用二维数组来实现生命游戏。但完整的实现应该允许无限大小的网格。使用与实现稀疏矩阵类似的方法来实现稀疏生命网格 ADT。
老实说，我不太理解这个概念。您能否给我一个外行人可以理解的简短描述（如果不是简短的代码）？我会很感激。
稀疏生命网格.py
""" My initial GameOfLife code
Feb 27, 2013
Sparse Matrix code specially designed for Game of Life
"""
class SparseLifeGrid:
def __init__(self):
"""
"pass" just allows this to run w/o crashing.
Replace it with your own code in each method.
"""
pass
def minRange(self):
"""
Return the minimum row & column as a list.
"""
pass
def maxRange(self):
"""
Returns the maximum row & column as a list.
"""
pass
def configure(self,coordList):
pass
def clearCell(self,row, col):
pass
def setCell(self,row, col):
pass
def isValidRowCol(val1,val2):
pass
def isLiveCell(self,row, col):
pass
def numLiveNeighbors(self, row,col):
pass
def __getitem__(self,ndxTuple):
pass
def __setitem__(self,ndxTuple, life):
"""
The possible values are only true or false:
True says alive, False for dead.
"""
pass
def _findPosition(self,row,col):
pass
def __repr__(self):
pass
def __str__(self):
"""
This method will only print the non-empty values,
and a row and column outside the non-empty values.
"""
pass
def evolve(self):
"""
Return the next generation state.
"""
pass
def hasOccurred(self):
"""
Check whether this current state has already occured.
If not, return False. If true, return which generation number (1-10).
"""
pass
def __eq__(self,other):
"""
This is good method if we want to compare two sparse matrices.
You can just use sparseMatrixA == sparseMatrixB because of this method.
"""
pass
def printLifeGrid(lifeGrid):
"""
Print a column before and after the live cells
"""
s=""
maxRange=lifeGrid.maxRange()
minRange=lifeGrid.minRange()
for i in range(minRange[0]-1,maxRange[0]+2):
for j in range(minRange[1]-1,maxRange[1]+2):
s+=" "+str(lifeGrid[i,j])
s+="\n"
print(s)
class _GoLMatrixElement:
"""
Storage class for one cell
"""
def __init__(self,row,col):
pass
def __str__self(self):
pass
def __eq__(self,other):
pass
这是我的主要文件
""" Marcus Brown's initial GameOfLife code
Feb 27, 2013
"""
from SparseLifeGrid_Key import SparseLifeGrid
import sys
# You'll probably need to add some other stuff like global variables
""" ####################################################
Don't change anything below this line: readPoints or main
""" ####################################################
def readPoints(lifeGrid):
"""
Reads the locations of life and set to the SparseMatrix
"""
print("1. Enter positions of life with row,col format (e.g., 2,3).")
print("2. Enter empty line to stop.")
life=input()
coordList=[]
while life:
points=life.split(",")
try:
coord=[int(points[0]),int(points[1])]
coordList.append(coord)
except ValueError:
print("Ignored input:" + life+ ", row, col not valid numbers")
except:
print("Unexpected error:", sys.exc_info()[0])
print("added, keep entering or enter empty line to stop.")
life=input()
print("Thanks, finished entering live cells")
lifeGrid.configure(coordList)
def main():
"""
Runs for ten generations if a stable (repeating) state is not found.
"""
lifeGrid= SparseLifeGrid()
readPoints(lifeGrid)
lifeGrid.printLifeGrid()
patterns=0
i=0
while i <10 and patterns == 0:
"""
Evolve to the next generation
"""
lifeGrid.evolve()
"""
Check whether this generation is a repetition of any of the
previous states.
If yes return the previous matching generation (1-10).
"""
patterns=lifeGrid.hasOccurred()
if patterns != -1:
break
i+=1
lifeGrid.printLifeGrid()
if i==10:
print("No pattern found")
else:
print("Pattern found at: " + str(i)+ " of type: " + str(patterns))
main()
稀疏矩阵是一种矩阵的表示形式，其中仅将不等于默认值（通常为 0）的值的位置存储在内存中。在 Python 中表示此类矩阵的一种简单方法是使用字典，其中键是坐标元组(x, y)，值是矩阵值。
例如，这个矩阵：
0 0 0 0
0 0 0 0
0 1 0 0
0 0 0 0
可以有以下表示：
matrix = [[0, 0, 0, 0], [0, 0, 0, 0], [0, 1, 0, 0], [0, 0, 0, 0]]
sparse_matrix = {(1, 2): 1}
你将访问这样的值：
for x in xrange(4):
for y in xrange(4):
assert matrix[y][x] == sparse_matrix.get((x, y), 0)
这应该足以让您开始。您的练习希望您将这样的稀疏矩阵包装在一个类中，该类将为其提供与传统矩阵相同的接口。
有更高级的方法来存储这种稀疏矩阵，每种方法在复杂性、内存使用量之间进行不同的权衡……