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: Donskoy, M.V.
Affiliations: Institute for System Studies, Moscow, USSR
Note: [1] This paper is part of a cooperative undertaking on Artificial Intelligence and Databases between the Institute for Systems Studies, Moscow and the University of Alberta, Edmonton, Canada. An earlier version of this paper was presented at the Advances in Computer Chess 6 Conference and appears here with the permission of Don Beal, Editor of the forthcoming Proceedings.
Abstract: This paper addresses the central problem of search in AI, specializing to chess programs. It surveys traditional ways of searching and stratagems of curtailing search. The paper proposes a few new search techniques, viz. domination search and confidence search.
DOI: 10.3233/ICG-1990-13304
Journal: ICGA Journal, vol. 13, no. 3, pp. 133-137, 1990
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]