OneEye Changeset - 9a3f61bf97f2

Changeset - 9a3f61bf97f2

Parent rev.

Child rev.

[Not reviewed]

default

0 3 0

Laman - 7 years ago 2017-12-21 20:26:37

StateBag: optimized a little, still slow

3 files changed with 65 insertions and 13 deletions:

src/benchmark.py

src/statebag.py

src/tests/testStatebag.py

0 comments (0 inline, 0 general)

src/benchmark.py

➞

Show inline comments

 import sys
 import cProfile
 from tests.testEngine import TestTransitions
 from tests.testStatebag import TestStateBag
 # t=TestTransitions()
+#
 # cProfile.run(r"""
 # t.testReal()
 # """)
 arg=sys.argv[1]
 t=TestStateBag()
 cProfile.run(r"""t.testReal()""")
 if arg=="engine":
 	t=TestTransitions()
 	cProfile.run(r"""t.testReal()""")
 elif arg=="statebag":
 	t=TestStateBag()
 	cProfile.run(r"""t.testReal()""")

src/statebag.py

➞

Show inline comments

@@ @@ -31,6 +31,40 @@ def estimateDistance(diff): @@
 	return replacements+1 # ???
 ## Update contents of diff1 by contents of diff2.
 def updateDiff(diff1,diff2):
 	res=[]
 	i=j=0
 	m=len(diff1)
 	n=len(diff2)
 	while i<m and j<n:
 		(r1,c1,action1,item1)=diff1[i]
 		(r2,c2,action2,item2)=diff2[j]
 		if (r1,c1)==(r2,c2):
 			merged=transformSingle(action1,item1,action2,item2)
 			if merged: res.append((r1,c1,*merged))
 			i+=1
 			j+=1
 		elif (r1,c1)<(r2,c2):
 			res.append(diff1[i])
 			i+=1
 		else:
 			res.append(diff2[j])
 			j+=1
 	if i<m: res.extend(diff1[i:])
 	else: res.extend(diff2[j:])
 	return res
 def transformSingle(action1,item1,action2,item2):
 	if action1=="+":
 		if action2!="-":
 			return ("+",item2)
 	elif action2=="-": return ("-",item2)
 	elif (action1=="*" and item1==item2) or (action1=="-" and item1!=item2): return ("*",item2)
 	return None
 class GameTreeNode:
 	def __init__(self,parent,color):
 		self.parent=parent
@@ @@ -54,11 +88,11 @@ class BoardState: @@
 	def __init__(self,board):
 		self._board=tuple(tuple(x for x in row) for row in board)
 		self.nodes=(GameTreeNode(self,BLACK),GameTreeNode(self,WHITE))
-		self.diff2Prev=None
+		self.cachedDiff=[]
 		self._hash=None
 	def tryConnect(self,s):
 		diff=self-s
 	def tryConnect(self,s,diff=None):
 		if diff is None: diff=self-s
 		distEst=estimateDistance(diff)
 		if distEst>3: return # we couldn't find every such move sequence anyway without a clever algorithm
 		weightEst=s.getWeight()+2-distEst
@@ @@ -114,11 +148,13 @@ class StateBag: @@
 		sn=BoardState(board)
 		if len(self._states)>0:
 			if sn==self._states[-1]: return None # no change
-			sn.diff2Prev=sn-self._states[-1]
+			sn.cachedDiff=sn-self._states[-1]
 		else: sn.setWeight(1)
 		diff=sn.cachedDiff
 		for s in reversed(self._states):
 			sn.tryConnect(s)
 			sn.tryConnect(s,diff)
 			diff=updateDiff(s.cachedDiff,diff)
 		self._states.append(sn)
 		return sn

src/tests/testStatebag.py

➞

Show inline comments

@@ @@ -5,7 +5,7 @@ import config as cfg @@
 from util import BLACK as B,WHITE as W,EMPTY as _
 from go.engine import SpecGo,Engine
 import go.engine
 from statebag import BoardState,StateBag
+from statebag import BoardState,StateBag,updateDiff
 from .util import simpleLoadSgf,listStates
@@ @@ -52,6 +52,21 @@ class TestBoardState(TestCase): @@
 		self.assertIs(s3.getPrev(), s2)
 		self.assertEqual(s3.getWeight(), 1)
 	def testUpdateDiff(self):
 		files=["O-Takao-20110106.sgf","Sakai-Iyama-20110110.sgf"]
 		for f in files:
 			moves=simpleLoadSgf(os.path.join(cfg.srcDir,"tests/data",f))
 			states=listStates(moves)
 			for (i,j,k) in [(1,2,3),(10,20,30),(90,100,110),(20,70,120)]:
 				s1=states[i]
 				s2=states[j]
 				s3=states[k]
 				diff1=s2-s1
 				diff2=s3-s2
 				with self.subTest(file=f,ijk=(i,j,k)):
 					self.assertEqual(s3-s1,updateDiff(diff1,diff2))
 class TestStateBag(TestCase):
 	def testReal(self):

0 comments (0 inline, 0 general)