Computer shogi
Open accessThe DOI matches its Crossref record; 41 of the 47 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Some Studies in Machine Learning Using the Game of Checkers
Samuel, A. L. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0210 · Cited by 4,443 · cited 1×
“In the early days of artificial-intelligence research, priority was given to the games of chess [57] and checkers [55].”
BackgroundProgramming a computer for playing chess
Shannon (1950) · The Philosophical Magazine A Journal of Theoretical Experimental and Applied Physics · Cited by 770
XXII. Programming a computer for playing chess
Shannon, C. E. (1950) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786445008521796 · Cited by 615
Chess-Playing Programs and the Problem of Complexity
Newell, A., Shaw, J. C., & Simon, H. A. (1958) · IBM Journal of Research and Development · doi:10.1147/rd.24.0320 · Cited by 321 · cited 1×
“A selective move generator would identify a sub-set of plausible moves using domain-specific knowledge [6,10,50]; the remaining moves would be discarded.”
BackgroundChess Skill in Man and Machine
(1977) · Springer eBooks · doi:10.1007/978-3-662-06239-5 · Cited by 168
Allis, L. V., van der Meulen, M., & van den Herik, H. J. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90004-3 · Cited by 162
Chess-Playing Programs and the Problem of Complexity
Newell, A., Shaw, J. C., & Simon, H. A. (1988) · Springer eBooks · doi:10.1007/978-1-4613-8716-9_7 · Cited by 135
Greenblatt, R. D., Eastlake, D. E., & Crocker, S. D. (1967) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1465611.1465715 · Cited by 129 · cited 1×
“A selective move generator would identify a sub-set of plausible moves using domain-specific knowledge [6,10,50]; the remaining moves would be discarded.”
BackgroundThe principal continuation and the killer heuristic
Akl, S. G., & Newborn, M. (1977) · ACM Annual Conference · doi:10.1145/800179.810240 · Cited by 104 · cited 1×
“The plausible move generators are considered in the following order: (1) the best move of the previous iteration, (2) capture the opponent piece that just moved, (3) prevent the opponent attack caused by the previous move, (4) a killer move [1], (5) the null move [4], (6) attack moves (capture, attack, promotion, aimi…”
BackgroundLevy, D., & Newborn, M. (1982) · Springer eBooks · doi:10.1007/978-3-642-85538-2_2 · Cited by 76
Research works printed but not linked: 29
- R. Grimbergen, An evaluation function for shogi, in: H. Matsubara (Ed.), Proceedings of Game Programming Workshop in Japan '97, Hakone, Japan, 1997, pp. 159-168.
- Frank, T.A. Marsland (Eds.), Proceedings of Second International Conference on Computers and Games, CG2000, Lecture Notes in Computer Science, Vol. 2063, Springer, Heidelberg, 2001, pp. 331-349.
- R. Grimbergen, H. Iida, Report on the 8th CSA world Computer-Shogi Championship, ICCA J. 21 (2) (1998) 135-138.
- T. Hashimoto, On-going work on brinkmate solver, J. Computer Shogi Assoc. 13 (2000) 44 (in Japanese).
- M. Hirose, H. Matsubara, T. Itoh, The composition of Tsume-Shogi problems, in: H.J. van den Herik, J.W.H.M. Uiterwijk (Eds.), Advances in Computer Chess, Vol. 8, Universiteit Maastricht, The Netherlands, 1997, pp. 299-318.
- H. Iida, F. Abe, Brinkmate search, in: Proceedings of Game Programming Workshop in Japan '96, Hakone, Japan, 1996, pp. 160-169.
- H. Iida, Grandmaster's exhibition handicap games with shogi programs at GPW'96, J. Computer Shogi Assoc. 10 (1997) 8-9 (in Japanese).
- H. Iida, Computer vs grandmaster, J. Computer Shogi Assoc. 11 (1998) 6-9 (in Japanese).
- H. Iida (Ed.), J. Computer Shogi Assoc. 11 (1998).
- H. Iida, J. Yoshimura, K. Morita, J.W.H.M. Uiterwijk, Retrograde analysis of the KGK endgame in shogi: Its implications for ancient Heian shogi, in: H.J. van den Herik, H. Iida (Eds.), Proceedings of First International Conference on Computers and Games, CG'98, Lecture Notes in Computer Science, Vol. 1558, Springer, Heidelberg, 1999, pp. 318-340.
- H. Iida, N. Sasaki, T. Hashimoto, J.W.H.M. Uiterwijk, H.J. van den Herik, Towards a classification of games using computer analyses, in: N. Neuwahl (Ed.), Proceedings of the International Colloquium "Board Games in Academia III", Florence, 1999, pp. 139-152.
- Y. Kakinoki, The search algorithms in the Shogi program K3.0, in: H. Matsubara (Ed.), Advances in Computer Shogi, Kyoritsu Shuppan, Tokyo, 1996. Chapter 1, pp. 1-23 (in Japanese).
- Y. Kakinoki, KAKINOKI won the Sapporo Meijin (B-class) title, J. Computer Shogi Assoc. 13 (2000) 22-27 (in Japanese).
- S. Kanazawa, The algorithms in Kanazawa Shogi, in: H. Matsubara (Ed.), Advances in Computer Shogi, Vol. 3, Kyoritsu Shuppan, Tokyo, 2000. Chapter 2, pp. 15-26 (in Japanese).
- Y. Kotani, Which computer shogi is strong?, in: H. Matsubara (Ed.), Advances in Computer Shogi, Vol. 3, Kyoritsu Shuppan, Tokyo, 2000, pp. 111-120 (in Japanese).
- H. Matsubara, H. Iida, R. Grimbergen, Natural Developments in game research, ICCA J. 19 (2) (1996) 103-112.
- H. Matsubara (Ed.), Advances in Computer Shogi, Vols. 1-3, Kyoritsu Shuppan, Tokyo, 1996, 1998, 2000 (in Japanese).
- A. Nagai, A new AND/OR tree search algorithm using proof number and disproof number, in: Proceedings of Complex Games Lab Workshop, ETL, Tsukuba, Japan, 1998, pp. 40-45.
- A. Nagai, The recent achievements of computer Tsume-Shogi: Challenges in solving problems with extremely long steps, J. Computer Shogi Assoc. 13 (2000) 34-42 (in Japanese).
- H. Nakaie, Y. Kotani, H. Iida, A method of applying opening book data to non-recorded positions, in: Proceedings of Game Programming Workshop in Japan '96, Hakone, Japan, 1996, pp. 218-227 (in Japanese).
- H. Nakaie, Y. Kotani, A method of applying opening book data by partial matching, in: Proceedings of Game Programming Workshop in Japan '97, Hakone, Japan, 1997, pp. 106-113 (in Japanese).
- T. Takizawa, Report on Computer-Shogi Grand Prix in 1999, J. Computer Shogi Assoc. 12 (1999) 39-41 (in Japanese).
- Frank, T.A. Marsland (Eds.), Proceedings of Second International Conference on Computers and Games, CG2000, Lecture Notes in Computer Science, Vol. 2063, Springer, Heidelberg, 2001, pp. 456-466.
- Y. Tanase, The algorithms in IS Shogi, in: H. Matsubara (Ed.), Advances in Computer Shogi, Vol. 3, Kyoritsu Shuppan, Tokyo, 2000. Chapter 1, pp. 1-14 (in Japanese).
- J.W.H.M. Uiterwijk, H.J. van den Herik, Speculative play in computer chess, in: H.J. van den Herik, I.S. Herschberg, J.W.H.M. Uiterwijk (Eds.), Advances in Computer Chess, Vol. 7, University of Limburg, Maastricht, 1994, pp. 79-90.
- H. Watanabe, H. Iida, J.W.H.M. Uiterwijk, Automatic composition of Shogi mating problems, in: H.J. van den Herik, H. Iida (Eds.), Games in AI Research, Van Spijk, Venlo, Netherlands, 2000, pp. 109-123.
- H. Yamashita, A report on two shogi programs participating in an open rating competition, J. Computer Shogi Assoc. 10 (1997) 3-7 (in Japanese).
- H. Yamashita, Half-extension algorithm, in: H. Matsubara (Ed.), Proceedings of Game Programming Workshop in Japan '97, Hakone, Japan, 1997, pp. 46-54.
- H. Yamashita, YSS-About the data structures and the algorithms, in: H. Matsubara (Ed.), Advances in Computer Shogi, Vol. 2, Kyoritsu Shuppan, Tokyo, 1998. Chapter 6, pp. 112-142 (in Japanese).
Cited by
A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., et al. (2018) · Science · doi:10.1126/science.aar6404 · Cited by 3,562
Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm
Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., et al. (2017) · arXiv · doi:10.48550/arxiv.1712.01815 · Cited by 1,102
“-champion Stockfish (25); other strong chess programs, including Deep Blue, use very similar architectures (9,21). Shogi is a significantly harder game, in terms of computational complexity, than chess (2, 14): it is played on a larger board, and any captured opponent piece changes sides and may subsequently be dropped…”
BackgroundGAME-TREE SEARCH ALGORITHM BASED ON REALIZATION PROBABILITY
Tsuruoka, Y., Yokoyama, D., & Chikayama, T. (2002) · ICGA Journal · doi:10.3233/icg-2002-25304 · Cited by 63
“Today, the majority of strong Shogi programs use many forwardpruning techniques (Iida, Sakuta, and Rollason, 2002).”
BackgroundYen, S.-J., Chen, J.-C., Yang, T.-N., & Hsu, S.-C. (2004) · ICGA Journal · doi:10.3233/icg-2004-27102 · Cited by 47
“STATE OF COMPUTER CHINESE CHESS The first Chinese-chess program was likely written by Liao (1982). The first scientific paper on computer Chinese chess was published by Zhang (1981).”
BackgroundLarge-Scale Optimization for Evaluation Functions with Minimax Search
Hoki, K., & Kaneko, T. (2014) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4217 · Cited by 36
“There are 13 types of pieces in shogi (Iida et al., 2002).”
Background
Metadata
- Authors
- Iida, H., Sakuta, M., & Rollason, J.
- Affiliations
- Shizuoka University (JP)
- Corresponding author
- Iida, Hiroyuki
- ORCID
- Iida, Hiroyuki
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2002-01
- Volume
- 134
- Issue
- 1-2
- Pages
- 121-144
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2913201078
- Cited by
- 59
- References
- 47
- Citations by year
- 2026: 2 · 2025: 1 · 2024: 2 · 2023: 2 · 2021: 2 · 2020: 4 · 2019: 3 · 2018: 5 · 2017: 2 · 2016: 2 · 2015: 4 · 2014: 4 · 2013: 3 · 2012: 1
- FWCI
- 1.97
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 4251 d)
- Locations
- Artificial Intelligence (publishedVersion)
- Funders
- Centrum fÖr Personcentrerad Vård
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence Applications
- Keywords
- computer shogi, shogi, game-playing programs, tree search, selective search, position evaluation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computer shogi. https://app.cochat.ai/papers/10.1016/s0004-3702(01)00157-6
- The paper
- Iida, H., Sakuta, M., & Rollason, J. (2002). Computer shogi. Artificial Intelligence. https://doi.org/10.1016/s0004-3702(01)00157-6
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.