Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Uiterwijk, Jos W.H.M.
Affiliations: Dept. of Computer Science, University of Limburg, Maastricht, The Netherlands
Abstract: A new move-ordering method is introduced: the countermove heuristic. It shows similarities with some previously described techniques, but differs sufficiently for a test of its effectiveness to be undertaken. The technique is based on the assumption that many moves have a “natural” response, irrespective of the actual position in which the moves occur. Results of the use of the countermove heuristic are given and compared with similar results when using some other techniques. It appears that the countermove heuristic yields some 20% reduction in computation time for single positions. When used in game fragments, this reduction may even rise to some 50%, depending on nominal search depth. The countermove heuristic therefore seems to be a valuable element in move ordering.
DOI: 10.3233/ICG-1992-15103
Journal: ICGA Journal, vol. 15, no. 1, pp. 8-15, 1992
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]