二人零和博弈monte carlo树搜索的python实现
mctsp的Python项目详细描述
mctspy:Monte Carlo树搜索算法的python实现
Monte Carlo Tree Search(MCTS)的基本python实现,用于在小型游戏树上运行
安装
pip3 install mctspy
运行tic tac toe示例
运行tic tac toe示例:
importnumpyasnpfrommctspy.tree.nodesimportTwoPlayersGameMonteCarloTreeSearchNodefrommctspy.tree.searchimportMonteCarloTreeSearchfrommctspy.games.examples.tictactoeimportTicTacToeGameStatestate=np.zeros((3,3))initial_board_state=TicTacToeGameState(state=state,next_to_move=1)root=TwoPlayersGameMonteCarloTreeSearchNode(state=initial_board_state)mcts=MonteCarloTreeSearch(root)best_node=mcts.best_action(10000)
为自己的2名玩家运行MCT零和游戏
如果您想为自己的游戏应用mct,其状态实现应该来自mmctspy.games.common.TwoPlayersGameState
(寻找灵感)