default search action
Journal of the International Computer Games Association, Volume 31
Volume 31, Number 1, March 2008
- Trevor I. Fenner, Mark Levene:
Move Generation with Perfect Hash Functions. J. Int. Comput. Games Assoc. 31(1): 3-12 (2008) - Graham Kendall, Andrew J. Parkes, Kristian Spoerer:
A Survey of NP-Complete Puzzles. J. Int. Comput. Games Assoc. 31(1): 13-34 (2008)
Volume 31, Number 2, June 2008
- Keh-Hsun Chen, Peigang Zhang:
Monte-Carlo Go with Knowledge-Guided Simulations. J. Int. Comput. Games Assoc. 31(2): 67-76 (2008) - Haw-ren Fang, James Glenn, Clyde P. Kruskal:
Retrograde Approximation Algorithms for Jeopardy Stochastic Games. J. Int. Comput. Games Assoc. 31(2): 77-96 (2008) - Azlan Iqbal, Mashkuri Yaacob:
Theme Detection and Evaluation in Chess. J. Int. Comput. Games Assoc. 31(2): 97-109 (2008)
Volume 31, Number 3, September 2008
- Matej Guid, Aritz Pérez, Ivan Bratko:
How Trustworthy is Crafty's Analysis of Chess Champions? J. Int. Comput. Games Assoc. 31(3): 131-144 (2008) - Guillaume Chaslot, Mark H. M. Winands, Istvan Szita, H. Jaap van den Herik:
Cross-Entropy for Monte-Carlo Tree Search. J. Int. Comput. Games Assoc. 31(3): 145-156 (2008) - Vladan Vuckovic:
The Compact Chessboard Representation. J. Int. Comput. Games Assoc. 31(3): 157-164 (2008)
Volume 31, Number 4, December 2008
- Nathan R. Sturtevant:
An Analysis of UCT in Multi-Player Games. J. Int. Comput. Games Assoc. 31(4): 195-208 (2008) - Sacha Droste, Johannes Fürnkranz:
Learning the Piece Values for Three Chess Variants. J. Int. Comput. Games Assoc. 31(4): 209-233 (2008) - Mark H. M. Winands:
6×6 LOA is Solved. J. Int. Comput. Games Assoc. 31(4): 234-238 (2008)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.