Abstract
Monte Carlo tree search is the state of the art for multiple games and for solving puzzles such as Morpion Solitaire. Nested Monte Carlo (NMC) search is a Monte Carlo tree search algorithm that works well for solving puzzles. We propose to enhance NMC search with beam search. We test the algorithm on Morpion Solitaire. Thanks to beam search, our program has been able to match the record score of 82 moves. Monte Carlo beam search achieves better scores in less time than NMC search alone.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Computational Intelligence and AI in Games
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.