Computer shogi

@article{Iida2002ComputerS,
  title={Computer shogi},
  author={Hiroyuki Iida and Makoto Sakuta and Jeff Rollason},
  journal={Artif. Intell.},
  year={2002},
  volume={134},
  pages={121-144}
}
This paper describes the current state of the art in computer shogi. Shogi (Japanese chess) promises to be a good vehicle for future research into game-playing programs that are based on tree-searching paradigms. This paper shows where chess and shogi are similar, and details the important areas that make shogi programming of particular interest. A crucial difference is the game-tree complexity, which is significantly higher in shogi than in chess. Three important differences are the “drop… CONTINUE READING
BETA

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 59 REFERENCES

The algorithms in IS Shogi

  • Y. Tanase
  • in: H. Matsubara
  • 2000
Highly Influential
4 Excerpts

The algorithms in Kanazawa Shogi

  • S. Kanazawa
  • in: H. Matsubara
  • 2000
Highly Influential
4 Excerpts

A new AND/OR tree search algorithm using proof number and disproof number

  • A. Nagai
  • in: Proceedings of Complex Games Lab Workshop…
  • 1998
Highly Influential
4 Excerpts

A note on algorithmic generation of tsume-shogi problems

  • K. Noshita
  • in: H. Matsubara (Ed.), Proceedings of Game…
  • 2002
2 Excerpts

Grandmaster’s exhibition handicap games with shogi programs at GPW’96

  • H. Iida
  • J. Computer Shogi Assoc. 10 () 8–9 (in Japanese…
  • 2002

H

  • G. Xinbo
  • Iida, J.W.H.M. Uiterwijk, H.J. van den Herik…
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…