default search action
Journal of the International Computer Games Association, Volume 28
Volume 28, Number 1, 2005
- Kohei Noshita:
Union-Connections and Straightforward Winning Strategies in Hex. J. Int. Comput. Games Assoc. 28(1): 3-12 (2005) - Barteld P. Kooi:
Yet Another Mastermind Strategy. J. Int. Comput. Games Assoc. 28(1): 13-20 (2005) - Ingo Althöfer, Susanne Heuser:
Randomised Evaluations in Single-Agent Search. J. Int. Comput. Games Assoc. 28(1): 21-31 (2005) - Jonathan Schaeffer:
Solving Checkers: First Result. J. Int. Comput. Games Assoc. 28(1): 32-36 (2005)
Volume 28, Number 2, 2005
- Mark Levene, Judit Bar-Ilan:
Comparing Move Choices of Chess Search Engines. J. Int. Comput. Games Assoc. 28(2): 67-76 (2005) - Haw-ren Fang:
The Nature of Retrograde Analysis for Chinese Chess - Part 1. J. Int. Comput. Games Assoc. 28(2): 91-105 (2005)
Volume 28, Number 3, 2005
- Robert M. Hyatt, Anthony Cozzie:
The Effect of Hash Signature Collisions in a Chess Program. J. Int. Comput. Games Assoc. 28(3): 131-139 (2005) - Haw-ren Fang:
The Nature of Retrograde Analysis for Chinese Chess - Part 2. J. Int. Comput. Games Assoc. 28(3): 140-152 (2005) - G. McC. Haworth:
6-Man Chess Solved. J. Int. Comput. Games Assoc. 28(3): 153 (2005) - Chung-Chih Li, Hikyoo Koh:
Using Joseki for Tactics Deployment in Computer Go. J. Int. Comput. Games Assoc. 28(3): 154-158 (2005)
Volume 28, Number 4, 2005
- J. Renze Steenhuizen:
New Results in Deep-Search Behaviour. 203-213 - Will Leckie, Michael A. Greenspan:
Pool Physics Simulation by Event Prediction 1: Motion Transitions. 214-222 - Jeng-Chi Yan, Shun-chin Hsu, H. Jaap van den Herik:
The Sacrifice Move. 223-234 - I-Chen Wu, Dei-Yen Huang, Hsiu-Chen Chang:
Connect6. 235-242 - G. McC. Haworth:
Chess-Endgame News. 243
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.