import copy

from grid import Grid

class Rule1(object):

	def iterate(self, oldgrid):

		grid = copy.deepcopy(oldgrid)

		for x in xrange(oldgrid.minx - 1, oldgrid.maxx + 2):

			for y in xrange(oldgrid.miny - 1, oldgrid.maxy + 2):

				#print x, y, self.neighbours(oldgrid, x, y)

				n = self.neighbours(oldgrid, (x, y))

				if n > 2:

					grid.set((x, y))					

		return grid

	def neighbours(self, grid, (testx, testy)):

		n = 0

		#print "testing ", testx, testy

		for x in range(testx - 1, testx + 2):

			for y in range(testy - 1, testy + 2):

				if (x, y) in grid.cells:

					n += 1

				#print x, y, n

		return n 

class Rule2(object):

	def iterate(self, oldgrid):

		grid = copy.deepcopy(oldgrid)

		for x in xrange(oldgrid.minx - 1, oldgrid.maxx + 2):

			for y in xrange(oldgrid.miny, oldgrid.maxy + 2):

				#print "testing ", x, y,

				if (x+1, y) in oldgrid.cells or (x, y-1) in oldgrid.cells:

					grid.set((x, y), 1)								

		return grid

import random

import marshal

class PotentialGrowth(object):

	def __init__(self):

		random.seed()

		self.potential = 4 # values 4-8 are viable

	def iterate(self, oldgrid):

		grid = oldgrid

		value_pos = {}

		for i in range(2, self.potential+1):

			if i in oldgrid.valuemap:

				value_pos[i] = copy.deepcopy(oldgrid.valuemap[i])

		for value, cells in value_pos.iteritems():

			for pos in cells:

				new_pos, new_value = self.grow(grid, pos)

				grid.set(new_pos, new_value)

				grid.set(pos, value - 1)				

		return grid

	def grow(self, grid, (x, y)):

		n1 = [(x-1, y), (x, y+1), (x+1, y), (x, y-1)]

		n2 = [(x+1, y+1), (x+1, y-1), (x-1, y-1), (x-1, y+1)]

		c0 = (n1, )

		c1 = (n1, n2)

		c2 = (n1, n1, n2)

		neighbours = random.choice(random.choice((c0, c1, c2)))

		neighbours = [n for n in neighbours if n not in grid.cells]

		if len(neighbours):

			pos = random.choice(neighbours)	

			value = self.potential

		else:

			pos = (x, y)

			value = grid.cells[pos]

		return pos, value