【发布时间】:2016-06-15 03:43:55
【问题描述】:
我找不到可以用来为国际象棋开局创建树结构的 python 树,所以我尝试自己编写。为了深入到树中,我尝试在添加新位置时返回子根,但似乎所有位置都被添加到根中,并且没有像我预期的那样获得对子根的引用,尽管我做了检查,root也有很多孙子。
import chess.pgn
class Node(object):
children = []
score = None
def __init__(self, fen):
self.fen = fen
def add(self, fen):
for c in self.children:
if c.fen == (fen):
print("working")
return c
self.children.append(Node(fen))
return self.children[-1]
root = Node('rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1')
def createTree(fileName):
pgn = open(fileName)
game = chess.pgn.read_game(pgn)
while(game):
next_move = game.variations[0]
fen = next_move.board().fen()
global root
currentRoot = root.add(fen)
while(not next_move.is_end() and next_move.board().fullmove_number <= 5):
next_move = next_move.variations[0]
fen = next_move.board().fen()
currentRoot = currentRoot.add(fen)
print(currentRoot.children)
game = chess.pgn.read_game(pgn)
file = r"C:\all.pgn"
createTree(file)
for n in root.children:
print(n.fen)
【问题讨论】:
-
请提供您正在使用的
chess.pgn库的下载链接。
标签: python tree parameter-passing pass-by-reference chess