Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Monte Carlo Tree Search (MCTS) is the state of the art algorithm for General Game Playing (GGP).  propose to learn a playout policy online so as to improve MCTS for GGP.  also propose to learn a policy not only using the moves but also according to the features of the moves.  test the resulting algorithms named Playout Policy Adaptation (PPA) and Playout Policy Adaptation with move Features (PPAF) on Atarigo, Breakthrough, Misere Breakthrough, Domineering, Misere Domineering, Knightthrough, MisereKnightthrough and Nogo. The experiments compare PPA and PPAF to Upper Confidence for Trees (UCT) and to the closely related Move-Average Sampling Technique (MAST) algorithm.
['Tristan Cazenave']
I am writing a research paper on a idea Playout policy adaptation with move features
[{"from": "human", "value": "I am writing a research paper on a idea Playout policy adaptation with move features"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Monte Carlo Tree Search (MCTS) is the state of the art algorithm for General Game Playing (GGP).  propose to learn a playout policy online so as to improve MCTS for GGP.  also propose to learn a policy not only using the moves but also according to the features of the moves.  test the resulting algorithms named Playout Policy Adaptation (PPA) and Playout Policy Adaptation with move Features (PPAF) on Atarigo, Breakthrough, Misere Breakthrough, Domineering, Misere Domineering, Knightthrough, MisereKnightthrough and Nogo. The experiments compare PPA and PPAF to Upper Confidence for Trees (UCT) and to the closely related Move-Average Sampling Technique (MAST) algorithm."}]