import logging as log

from .helperboard import HelperBoard

from .gamerecord import GameRecord

class Go:

	## Initializes self.board to a list[r][c]=EMPTY.

	def __init__(self,boardSize=19):

		self.boardSize=boardSize

		self.board=[[EMPTY]*boardSize for x in range(boardSize)]

		self.toMove=BLACK

		self._helper=HelperBoard(self.board)

		self._record=GameRecord()

	def listMoves(self,diff=[]):

		return []

	## Executes a move.

	#

	#  Doesn't check for kos. Suicide not allowed.

	#

	#  @param color BLACK or WHITE

	#  @return True on success, False on failure (illegal move)

	def doMove(self,color,row,col):

		# capture neighbors

		for r,c in ((-1,0),(1,0),(0,-1),(0,1)):

			self._helper.clear()

			if not self._helper.floodFill(-color,row+r,col+c,EMPTY): self._remove()

		# check for suicide

		self._helper.clear()

		if not self._helper.floodFill(color,row,col,EMPTY):

			self.board[row][col]=EMPTY

			return False

		self._record.move(color,row,col)

		self.toMove=-1*color

		return True

		if len(captures)>0:

			self._helper.clear()

			for (r,c) in captures:

				self._helper.floodFill(EMPTY,r,c)

	def transitionMove(self,board):

		res=transitionMove(self.board,board)

		if not res: return res

		(r,c,color)=res

		return self.doMove(color,r,c)

	## Removes stones at coordinates marked with True in self.helper.

	def _remove(self):

		self._fill(EMPTY)

	def _fill(self,filling):

		for (r,c) in self._helper.getContinuousArea():

			self.board[r][c]=filling

def exportBoard(board):

	substitutions={EMPTY:".", BLACK:"X", WHITE:"O"}

	return "\n".join("".join(substitutions.get(x,"?") for x in row) for row in board)

def transitionSequence(state1, state2, diff, limit=0):

	return []

class SpecGo(core.Go):

	def load(self,state):

		for (r,row) in enumerate(state):

			for (c,x) in enumerate(row):

				self.board[r][c]=x

	def listRelevantMoves(self,diff):

		"""There can be 3 different changes in the diff: additions, deletions and replacements.

		Additions can be taken as relevant right away.

		Deletions and replacements had to be captured, so we add their liberties.

		Also any non-missing stones of partially deleted (or replaced) groups had to be replayed, so add them too.

		Needs to handle: Take n, return 1. Snapback.

		There's no end to what could be theoretically relevant, but such sequences are long and we will pretend they won't happen."""

		res=(set(),set())

		for d in diff:

			(r,c,action,color)=d

			colorKey=(1-color)<<1 # {-1,1}->{1,0}

			if action!="-" and (r,c) not in res[colorKey]:

			# this is rather sloppy but correct. the time will show if it is effective enough

			if action!="+" and (r,c) not in res[colorKey] and (r,c) not in res[1-colorKey]:

				self._helper.clear()

				self._helper.floodFill(color if action=="-" else 1-color, r, c)

				res[colorKey].union(self._helper.getContinuousArea())

				for (ri,ci) in self._helper.getContinuousArea():

					res[colorKey].add((ri,ci))

					res[1-colorKey].add((ri,ci))

					if ri>0:

						res[colorKey].add((ri-1,ci))

						res[1-colorKey].add((ri-1,ci))

					if ri<self.boardSize:

						res[colorKey].add((ri+1,ci))

						res[1-colorKey].add((ri+1,ci))

					if ci>0:

						res[colorKey].add((ri,ci-1))

						res[1-colorKey].add((ri,ci-1))

					if ci<self.boardSize:

						res[colorKey].add((ri,ci+1))

						res[1-colorKey].add((ri,ci+1))

		return res

class Engine:

		self._moveList=(set(),set())

	def load(self,state1,diff):

		self._g.load(state1)

		self._moveList=self._g.listRelevantMoves(diff)

	def iterativelyDeepen(self,state2):

		for i in range(1,10):

	def dfs(self,state2,limit):

		g=self._g

			g.doMove(g.toMove,r,c)

			if limit>1:

				seq=self.dfs(state2,limit-1)

				if seq:

					return seq

		return False

eng=Engine()

User can change detector parameters, presumably in case the previous don't fit the (current) situation.

In such a case we assume the new parameters are correct from the current position onwards.

But the change might have been appropriate even earlier (before the user detected and fixed an error).

So we try to find the correct crossover point like this:

- construct a sequence S' = s'_i, ..., s'_n by reanalyzing the positions with a new set of parameters, where s_i is the point of previous user intervention or s_0

- for each s'_j:

	- try to append it to S[:j]

	- try to append it to S'[:j]

	- remember the better variant

- linearize the fork back by discarding s'_j-s preceding the crossover and s_j-s following the crossover

"""

from go.engine import transitionSequence

## Crude lower bound on edit distance between states.

def estimateDistance(diff):

	# lot of room for improvements

	additions=sum(1 for d in diff if d[2]=="+")

	deletions=sum(1 for d in diff if d[2]=="-")

	replacements=len(diff)-additions-deletions

	if additions>0: return additions+replacements

	elif replacements==0 and deletions>0: return 2 # take n, return 1

	return replacements+1 # ???

class BoardState:

	def __init__(self,board):

		self._board=tuple(tuple(x for x in row) for row in board)

		self.prev=None

		self._next=None

		self.moves=[]

		self.weight=0

		self.diff2Prev=None

	def hash(self):

	def __iter__(self): return iter(self._board)

	def __getitem__(self,key): return self._board[key]

	def __sub__(self,x):

		res=[]

		for (r,(row1,row2)) in enumerate(zip(self._board,x)):

			for (c,(item1,item2)) in enumerate(zip(row1,row2)):

				if item1==item2: continue

				elif item2==EMPTY: res.append((r,c,"+",item1))

				elif item1==EMPTY: res.append((r,c,"-",item2))

				else: res.append((r,c,"*",item1)) # ->to

		return res

	def __eq__(self,x):

class StateBag:

	def __init__(self):

		self._states=[]

	def pushState(self,board):

		sn=BoardState(board)

		if self._states and sn==self._states[-1]: return # no change

		for s in reversed(self._states):

			diff=sn-s

import multiprocessing

import logging as log

EMPTY=0

BLACK=1

WHITE=-1

colorNames={BLACK:"B",WHITE:"W"}

class MsgQueue:

		while True:

			self._event.wait()

			msg=self._queue.get()

			if self._queue.empty():

				self._event.clear()

			log.info(msg)

			if msg[0]=="!kill": break

			self._handleEvent(msg)

	def setHandler(self,handler):

		self._handleEvent=handler