default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of the International Computer Games Association, Volume 29
Volume 29, Number 1, March 2006
- Fridel Fainshtein, Yaakov HaCohen-Kerner:
A Chess Composer of Two-Move Mate Problems. ICGA J. 29(1): 3-23 (2006) - Will Leckie, Michael A. Greenspan:
Pool Physics Simulation by Event Prediction 2: Collisions. ICGA J. 29(1): 24-31 (2006) - Azlan Iqbal:
Is Aesthetics Computable? ICGA J. 29(1): 32-39 (2006) - G. McC. Haworth:
Chess Endgame News. ICGA J. 29(1): 40 (2006)
Volume 29, Number 2, June 2006
- Ulf Lorenz:
A New Implementation of Error Analysis in Game Trees. ICGA J. 29(2): 55-64 (2006) - Matej Guid, Ivan Bratko:
Computer Analysis of World Chess Champions. ICGA J. 29(2): 65-73 (2006) - Tom Kronenburg, H. H. L. M. Donkers, Alex J. de Voogt:
Never-Ending Moves in Bao. ICGA J. 29(2): 74-78 (2006) - G. McC. Haworth:
Chess Endgame News. ICGA J. 29(2): 79 (2006)
Volume 29, Number 3, September 2006
- Darse Billings, Morgan Kan:
A Tool for the Direct Assessment of Poker Decisions. ICGA J. 29(3): 119-142 (2006) - Rickard Andersson:
Pseudo-Optimal Strategies in No-Limit Poker. ICGA J. 29(3): 143-149 (2006) - G. McC. Haworth:
Chess Endgame News. ICGA J. 29(3): 150 (2006)
Volume 29, Number 4, December 2006
- Keh-Hsun Chen, Peigang Zhang:
A New Heuristic Search Algorithm for Capturing Problems in Go. ICGA J. 29(4): 183-190 (2006) - Manal M. Zaky, Cherif R. S. Andraos, Salma A. Ghoneim:
New Approximate Strategies for Playing Sum Games. ICGA J. 29(4): 191-198 (2006) - Darse Billings:
On the Importance of Embracing Risk in Tournaments. ICGA J. 29(4): 199-202 (2006) - Aviezri S. Fraenkel:
Nim is Easy, Chess is Hard - But Why?? ICGA J. 29(4): 203-206 (2006)
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.
last updated on 2025-12-04 22:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
