![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Journal of the International Computer Games Association, Volume 24
Volume 24, Number 1, March 2001
- Mark H. M. Winands, Jos W. H. M. Uiterwijk
, H. Jaap van den Herik:
The Quad Heuristic in Lines of Action. 3-15 - K. P. Coplan:
Synthesis of Chess and Chess-like Endgames: A Proof of Correctness. 16-29 - János Wágner, István Virág:
Solving Renju. 30-35
Volume 24, Number 2, June 2001
- Ernst A. Heinz:
Self-play, Deep Search and Diminishing Returns. 75-79 - J. A. Tamplin, G. McC. Haworth:
Ken Thompson's 6-Man Tables. 83-85 - Lewis Stiller:
Retrograde Analysis: Software Architecture. 86-87 - Harold M. J. F. van der Heijden:
Endgame Tables and Endgame Study Composition. 88-92 - Noam D. Elkies:
Endgame Tables and Chess Composition. 93-101 - John D. Beasley:
Computer Discoveries in Losing Chess. 102-104 - Václav Kotesovec:
King and Two Generalised Knights against King. 105-107
Volume 24, Number 3, September 2001
- Jonathan Schaeffer:
Technology Transfer from One High-Performance Search Engine to Another. 131-146 - Ren Wu, Donald F. Beal:
Fast, Memory-efficient Retrograde Algorithms. 147-159 - G. McC. Haworth:
Depth by the Rule. 160 - G. McC. Haworth:
Discarding Like Pieces. 161
Volume 24, Number 4, December 2001
- Keh-Hsun Chen:
Computer Go: Knowledge, Search, and Move Decision. 203-215 - S. Paramasamy:
Online Interpretation of Chess Columns. 216-224 - G. McC. Haworth, Peter Karrer, J. A. Tamplin, Christoph Wirth:
3-5-Man Chess: Maximals and Mzugs. 225-230 - Makoto Sakuta, Hiroyuki Iida:
AND/OR-Tree Search Algorithms in Shogi Mating Search. 231-235
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.