On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms

Fabien Teytaud, Olivier Teytaud. On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms. In Georgios N. Yannakakis, Julian Togelius, editors, Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, CIG 2010, Copenhagen, Denmark, 18-21 August, 2010. pages 359-364, IEEE, 2010. [doi]

@inproceedings{TeytaudT10-0,
  title = {On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms},
  author = {Fabien Teytaud and Olivier Teytaud},
  year = {2010},
  doi = {10.1109/ITW.2010.5593334},
  url = {http://doi.ieeecomputersociety.org/10.1109/ITW.2010.5593334},
  researchr = {https://researchr.org/publication/TeytaudT10-0},
  cites = {0},
  citedby = {0},
  pages = {359-364},
  booktitle = {Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, CIG 2010, Copenhagen, Denmark, 18-21 August, 2010},
  editor = {Georgios N. Yannakakis and Julian Togelius},
  publisher = {IEEE},
  isbn = {978-1-4244-6295-7},
}