Using Monte Carlo Tree Search for replanning in a multistage simultaneous game

Daniel Beard, Philip Hingston, Martin Masek. Using Monte Carlo Tree Search for replanning in a multistage simultaneous game. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2012, Brisbane, Australia, June 10-15, 2012. pages 1-8, IEEE, 2012. [doi]

@inproceedings{BeardHM12,
  title = {Using Monte Carlo Tree Search for replanning in a multistage simultaneous game},
  author = {Daniel Beard and Philip Hingston and Martin Masek},
  year = {2012},
  doi = {10.1109/CEC.2012.6256428},
  url = {http://dx.doi.org/10.1109/CEC.2012.6256428},
  researchr = {https://researchr.org/publication/BeardHM12},
  cites = {0},
  citedby = {0},
  pages = {1-8},
  booktitle = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2012, Brisbane, Australia, June 10-15, 2012},
  publisher = {IEEE},
  isbn = {978-1-4673-1510-4},
}