MOUSE(mu): A Self-teaching Algorithm that Achieved Master-Strength at Othello

Konstantinos Tournavitis. MOUSE(mu): A Self-teaching Algorithm that Achieved Master-Strength at Othello. In Jonathan Schaeffer, Martin Müller 0003, Yngvi Björnsson, editors, Computers and Games, Third International Conference, CG 2002, Edmonton, Canada, July 25-27, 2002, Revised Papers. Volume 2883 of Lecture Notes in Computer Science, pages 11-28, Springer, 2002. [doi]

@inproceedings{Tournavitis02,
  title = {MOUSE(mu): A Self-teaching Algorithm that Achieved Master-Strength at Othello},
  author = {Konstantinos Tournavitis},
  year = {2002},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2883&spage=11},
  tags = {teaching},
  researchr = {https://researchr.org/publication/Tournavitis02},
  cites = {0},
  citedby = {0},
  pages = {11-28},
  booktitle = {Computers and Games, Third International Conference, CG 2002, Edmonton, Canada, July 25-27, 2002, Revised Papers},
  editor = {Jonathan Schaeffer and Martin Müller 0003 and Yngvi Björnsson},
  volume = {2883},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-20545-4},
}