Random positions in Go

2011 IEEE Conference on Computational Intelligence and Games, CIG 2011

Volumn , Issue , 2011, Pages 250-257

  Helmstetter, Bernard ^d   Lee, Chang Shing ^c   Teytaud, Fabien ^b   Teytaud, Olivier ^b   Wang, Mei Hui ^c   Yen, Shi Jim ^a  

^a NATIONAL DONG HWA UNIVERSITY   (Taiwan)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c NATIONAL UNIVERSITY OF TAINAN   (Taiwan)

^d UNIVERSITÉ PARIS 8   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASIAN GAMES; RANDOM POSITION; RELATIVE STRENGTH;

ARTIFICIAL INTELLIGENCE;

EXPERIMENTS;

EID: 80054049505     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2011.6032014     Document Type: Conference Paper

References (14)

1. R. Coulom, "Efficient Selectivity and Backup Operators in Monte- Carlo Tree Search, " In P. Ciancarini and H. J. van den Herik, editors, Proceedings of the 5th International Conference on Computers and Games, Turin, Italy, pp. 72-83, 2006.
2. S. Gelly and D. Silver, "Combining online and offline knowledge in UCT, " in ICML '07: Proceedings of the 24th international conference on Machine learning. New York, NY, USA: ACM Press, 2007, pp. 273-280.
3. B. Bouzy and G. Chaslot, "Bayesian generation and integration of k-nearest-neighbor patterns for 19x19 go, " In G. Kendall and Simon Lucas, editors, IEEE 2005 Symposium on Computational Intelligence in Games, Colchester, UK, pp. 176-181, 2005.
4. A. Rimmel, O. Teytaud, C.-S. Lee, S.-J. Yen, M.-H. Wang, and S.-R. Tsai, "Current Frontiers in Computer Go, " IEEE Transactions on Computational Intelligence and Artificial Intelligence in Games, p. in press, 2010. [Online]. Available: http://hal.inria.fr/inria-00544622/en/
5. T. Cazenave and N. Jouandeau, "On the parallelization of UCT, " in Proceedings of CGW07, 2007, pp. 93-101.
6. S. Gelly, J. B. Hoock, A. Rimmel, O. Teytaud, and Y. Kalemkarian, "The parallelization of Monte-Carlo planning, " in Proceedings of the International Conference on Informatics in Control, Automation and Robotics (ICINCO 2008), 2008, pp. 198-203.
7. P. Audouard, G. Chaslot, J.-B. Hoock, J. Perez, A. Rimmel, and O. Teytaud, "Grid coevolution for adaptive simulations; application to the building of opening books in the game of Go, " in Proceedings of EvoGames. Springer, 2009, pp. 323-332.
8. A. De Groot, Thought and choice in chess. Mouton De Gruyter, 1978.
9. A. De Groot, F. Gobet, and R. Jongman, Perception and memory in chess: Studies in the heuristics of the professional eye. Van Gorcum & Co, 1996.
10. F. Gobet and H.-A. Simon, "Recall of random and distorted positions: Implications for the theory of expertise, " Memory & Cognition, no. 24, pp. 493-503, 1996. (Pubitemid 26249651)
11. A. Bourki, G. Chaslot, M. Coulm, V. Danjean, H. Doghmen, J.-B. Hoock, T. Hérault, A. Rimmel, F. Teytaud, O. Teytaud, P. Vayssière, and Z. Yu, "Scalability and parallelization of monte-carlo tree search, " in Proceedings of Advances in Computer Games 13, 2010.
12. K. Chairasmisak, Enseignements d'un dirigeant asiatique (exists in Chinese). D'organisation, 2005.
13. D. Lichtenstein and M. Sipser, "Go is polynomial-space hard, " J. ACM, vol. 27, no. 2, pp. 393-401, 1980.
14. J. M. Robson, "The complexity of go, " in IFIP Congress, 1983, pp. 413-417.