A Shogi-computer test set
Pages 139 - 146
References
[1]
Anatharaman, T.S., Campbell, M.S. and Hsu, F.-h. (1989). Singular Extensions: Adding Selectivity to Brute-Force Searching. Artificial Intelligence, Vol. 43, No. I. pp. 99-109.
[2]
Berliner, H., Kopec, D. and Northam, E. (1991). A Taxonomy of Concepts for Evaluating Chess Strength: Examples from Two Difficult Categories. Advances in Computer Chess 6 (ed. D.F. Beal), pp. 179-I 9 1. Ellis Hot-wood, Chichester.
[3]
Condon, J.H. and Thompson, K. (1983). Belle. Chess Skill in Man and Machine (ed. P.W. Frey), second edition, pp. 201- 21 0. Springer-Verlag. New York.
[4]
Grottling, G. (1984). The Truth about their Strength. ICCA Journal, Vol. 7, No. 4, pp. 221-226.
[5]
Grottling, G. (1985). Problem-Solving Ability Tested. ICCA Journal, Vol. 8, No. 2, pp. 107- 110.
[6]
Haring, J. (1985). A Problem to Solve. ICCA Journal, Vol. 8, No. 3, p. 181.
[7]
Iida, H. (1993). Shogi in Europe. Uniprint, University of Limburg, Maastricht.
[8]
Iida, H. (1994). Morita Shogi vs. a Professional Player. Report of Japan Computer Shogi Association, Vol. 7, pp. 100-106. (in Japanese)
[9]
Iida, H. (1994). Heuristic Theories on Game-Tree Search. Ph.D thesis. Tokyo University of Agriculture and Technology, Tokyo.
[10]
Jansen, P. (1990). Problematic Positions and Speculative Play. Computers, Chess, and Cognition (eds. T.A. Marsland and J. Schaeffer), pp. 169-182. Springer-Verlag, New York.
[11]
Kaindl, H. (1988a). Minimaxing: Theory and Practice. AI Magazine, Vol. 9, No. 3, pp. 102-104.
[12]
Kaindl, H. (1988b). Useful Statistics from Tournament Programs. ICCA Journal, Vol. 11, No. 4, pp. 156- 159.
[13]
Kaindl, H. (1990). Tree Searching Algorithms. Computers, Chess, and Cognition (eds. T.A. Marsland and I. Schaeffer), pp. 133-158. Springer-Verlag, New York.
[14]
Kopec, D. and Bratko, I. (1982). The Bratko-Kopec Experiment: A Comparison of Human and Computer Performance in Chess. Advances in Cornpurer Chess 3 (ed. M.R.B. Clarke), pp. 57-72. Pergamon Press, Oxford.
[15]
Lindner, L. (1983). Experience with the Second Human- Computer Problem Test. ICCA Journal, Vol. 6, No. 3, pp. 10-15.
[16]
Lindner, L. (1985). A Critique of Problem-Solving Ability. ICCA Journal, Vol. 8, No. 3, pp. 182-185.
[17]
Marsland, T.A. and Rushton, P. (1973). Mechanisms for Comparing Chess Programs. Proceedings ACM National Conference October, pp. 202-205.
[18]
Marsland, T.A. (1990). The Bratko-Kopec Test Revisited. Computers, Chess, and Cognition (eds. T.A. Marsland and J. Schaeffer), pp. 217-223. Springer-Verlag. New York.
[19]
Matsubara, H. (1992-1995). Report of the 2nd Computer Shogi Championship. Bit, Vol. 24, pp. 400-409; 1992. Report of the 3rd Computer Shogi Championship. Bit, Vol. 25, No. 4, pp. 46-53; 1993. Report of the 5th Computer Shogi Championship. Bit, Vol. 27, No. 6, pp. 85-92; 1995. Kyoritsushuppan. (in Japanese)
[20]
Matsubara, H. (1993). Shogi (Japanese Chess) as the Al Research Target next to Chess. E7'L rechrlicul report, ETL-TR- 93-23. Electrotechnical Laboratory, Tsukuba.
[21]
Matsubara, H. and Iida, H. (1995). An Evaluation of Strength of Shogi Programs by a Next-Move Set. Bullerin of Electrotechnical Laboratory, Vol. 59, No. 4, pp. 25-57. (in Japanese)
[22]
Nau, D.S. (1980). Pathology in Game Trees: a Summary of Results. AAAI Conference Proceedings, pp. 102-104.
[23]
Nau, D.S. (1983). Pathology on Game Trees Revisited and an Alternative to Minimaxing. Artijicial Intelligence, Vol. 2 1, No. l-2, pp. 22 l-244.
[24]
Newborn, M. (1979). Recent Progress in Computer Chess. Advances in Computers (ed. M. Yovits), Vol. 18, pp. 59-l 17. Academic Press, New York.
[25]
Newborn, M. (1985). A Hypothesis Concerning the Strength of Chess Programs. ICCA Journal, Vol. 8, No. 4. pp. 209-2 15.
[26]
Nielsen, J.B. (1991). A Chess-Computer Test Set. ICCA Journal, Vol. 14, No. 1, pp. 33-37.
[27]
Pearl, J. (1983). On the Nature of Pathology in Game Searching. Artijciul Intelligence, Vol. 20, NO. 1-2, pp. 427-453.
[28]
Reinfeld, F. (1945). Win at Chess. McKay, New York. Also (1958), Dover, New York.
[29]
Thompson, K. (1982). Computer Chess Strength. Advances in Computer Chess 3 (ed. M.R.B. Clarke), pp. 55-56. Pergamon Press, Oxford.
[30]
Wiereyn, P.H. (1985a). Problem-Solving Ability Tested II. ICCA Journal, Vol. 8, No. 3, pp. 179-180.
[31]
Wiereyn, P.H. (1985b). Inventive Problem Solving. ICCA Journal, Vol. 8, No. 4, pp. 230-234.
Index Terms
- A Shogi-computer test set
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1996 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 February 1996
Check for updates
Qualifiers
- Article
Conference
CSC96
Sponsor:
CSC96: 24th Annual ACM Computer Science Conference
February 15 - 18, 1996
Pennsylvania, Philadelphia, USA
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 437Total Downloads
- Downloads (Last 12 months)80
- Downloads (Last 6 weeks)8
Reflects downloads up to 11 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in