ICGA Journal - Volume 17, issue 4

Authors: Herschberg, Bob | van den Herik, Jaap

Article Type: Editorial

DOI: 10.3233/ICG-1994-17401

Citation: ICGA Journal, vol. 17, no. 4, pp. 181-182, 1994

Authors: Breuker, D.M. | Uiterwijk, J.W.H.M. | van den Herik, H.J.

Article Type: Research Article

Abstract: Almost every chess program makes use of a transposition table, typically implemented as a large hash table. Even though this table is usually made as large as possible, subject to memory constraints, collisions occur. Then a choice has to be made which position to retain or to replace in the table, using some replacement scheme. This article compares the performance of seven replacement schemes, as a function of transposition-table size, on some chess middle-game positions. A two-level table, using the number of nodes in the subtree searched as the deciding criterion, performed best and is provisionally recommended.

DOI: 10.3233/ICG-1994-17402

Citation: ICGA Journal, vol. 17, no. 4, pp. 183-193, 1994

Authors: Ciancarini, Paolo

Article Type: Research Article

Abstract: This paper attempts to explore the impact of greatly enhanced computing power on the alpha-beta algorithm, notorious for its high processing requirements. On a limited set of test positions, it explores, under some limitations, the question of how best to distribute the power of multiple processes. The main matters probed at least in tendency are the vital questions of when to split the search among processes and, once splitting has been decided upon, to which process to split. Stress is laid on the apparent limitation of speed-up, for which a severe law of diminishing returns soon sets in …under any reasonable conditions, even when the best feasible splitting strategy is utilized. It is shown, again in tendency, that fertile further exploration essentially requires architectures with intrinsically low communication and context-switching overheads. A uniform hardware/software platform Network C-Linda , is presented as essentially free of distortion under carefully stated conditions. Show more

DOI: 10.3233/ICG-1994-17403

Citation: ICGA Journal, vol. 17, no. 4, pp. 194-206, 1994

Authors: de Bruin, Arie | Pijls, Wim | Plaat, Aske

Article Type: Research Article

Abstract: A game-tree algorithm is an algorithm computing the minimax value of the root of a game tree. Two well-known game-tree-search algorithms are alpha-beta and SSS*. We show that there exists a relation between these algorithms, which are commonly regarded as quite different. Many algorithms use the notion of establishing proofs that the game value lies above or below some bound. We show that this is equivalent to the construction of a solution tree. We discuss the role of solution trees and critical trees in the following algorithms: alpha-beta, PVS, SSS-2 and Proof-Number Search. A general procedure for the construction …of a solution tree, based on alpha-beta and Null-Window Search, is given. Show more

DOI: 10.3233/ICG-1994-17404

Citation: ICGA Journal, vol. 17, no. 4, pp. 207-219, 1994

Authors: Beal, Don

Article Type: Other

DOI: 10.3233/ICG-1994-17406

Citation: ICGA Journal, vol. 17, no. 4, pp. 219-219, 1994

Article Type: Other

DOI: 10.3233/ICG-1994-17405

Citation: ICGA Journal, vol. 17, no. 4, pp. 219-219, 1994

Authors: Iida, Hiroyuki

Article Type: Book Review

DOI: 10.3233/ICG-1994-17407

Citation: ICGA Journal, vol. 17, no. 4, pp. 220-220, 1994

Authors: Junghanns, Andreas

Article Type: Book Review

DOI: 10.3233/ICG-1994-17408

Citation: ICGA Journal, vol. 17, no. 4, pp. 220-220, 1994

Authors: Lachmann, Grit

Article Type: Book Review

DOI: 10.3233/ICG-1994-17409

Citation: ICGA Journal, vol. 17, no. 4, pp. 221-221, 1994

Authors: Baba, Takanobu

Article Type: Short Communication

DOI: 10.3233/ICG-1994-17410

Citation: ICGA Journal, vol. 17, no. 4, pp. 221-221, 1994