AlphaGoの論文に “the introduction of MCTS, led to corresponding advances in many other domains; for example, general game-playing, classical planning, partially observed planning, scheduling, and constraint satisfaction[35,36].” とあった。 MCTSって制約充足問題にも使われてたのか。
35. Browne, C. et al. A survey of Monte-Carlo tree search methods. IEEE Trans. Comput. Intell. AI in Games 4, 1–43 (2012).
36. Gelly, S. et al. The grand challenge of computer Go: Monte Carlo tree search and extensions. Commun. ACM 55, 106–113 (2012).
Monte-Carlo Style UCT Search for Boolean Satisfiability
http://link.springer.com/chapter/10.1007%2F978-3-642-23954-0_18
https://www.researchgate.net/publication/221152995_Monte-Carlo_Style_UCT_Search_for_Boolean_Satisfiability
Bandit-Based Search for Constraint Programming
http://link.springer.com/chapter/10.1007/978-3-642-40627-0_36
https://hal.inria.fr/hal-00863451/file/paper123.pdf