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: Althöfer, I.; *
Note: [*] Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena, 07740 Jena, Germany. E-mail: [email protected].
Abstract: Some commercial chess programs allow to compute not only the best move but also the k best moves for each position. Most frequently used are k = 2 and k = 3. Unfortunately, sometimes the moves are too similar in such a k-best list, or otherwise stated they do not discriminate among plans. A scheme examining the similarity and eliminating move proposals that are too similar is suggested. A simple approach dealing with this problem is presented.
DOI: 10.3233/ICG-1997-20303
Journal: ICGA Journal, vol. 20, no. 3, pp. 152-165, 1997
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]