메뉴 건너뛰기




Volumn 1558, Issue , 1999, Pages 300-317

A survey of tsume-shogi programs using variable-depth search

Author keywords

Best first search; Conspiracy number search; Game playing; Tsume shogi; Variable depth search

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 0007951867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48957-6_20     Document Type: Conference Paper
Times cited : (4)

References (30)
  • 3
    • 0025419775 scopus 로고
    • Singular extensions: Adding selectivity to brute-force searching
    • T. Anantharaman, M.S. Campbell, and F. Hsu. Singular extensions: Adding selectivity to brute-force searching. Artificial Intelligence, 43:99-109, 1990.
    • (1990) Artificial Intelligence , vol.43 , pp. 99-109
    • Anantharaman, T.1    Campbell, M.S.2    Hsu, F.3
  • 5
    • 0002606397 scopus 로고    scopus 로고
    • The composition of tsume-shogi problems
    • Maastricht, Holland, ISBN 9062162347
    • M. Hirose, H. Matsubara, and T. Ito. The composition of tsume-shogi problems. In Advances in Computer Chess 8, pages 299-319, Maastricht, Holland, 1996. ISBN 9062162347.
    • (1996) Advances in Computer Chess , vol.8 , pp. 299-319
    • Hirose, M.1    Matsubara, H.2    Ito, T.3
  • 6
    • 84956859912 scopus 로고    scopus 로고
    • Best-first search to solve tsume shogi problems
    • H. Matsubara, editor, Tokyo: Kyoritsu Shuppan Co, ISBN 4-320-02799-X. (In Japanese)
    • K. Ito. Best-first search to solve tsume shogi problems. In H. Matsubara, editor, Computer Shogi Progress, pages 71-89. Tokyo: Kyoritsu Shuppan Co, 1996. ISBN 4-320-02799-X. (In Japanese).
    • (1996) Computer Shogi Progress , pp. 71-89
    • Ito, K.1
  • 7
    • 84956865939 scopus 로고
    • On the algorithms for solving tsume-shogi with extremely long solution-steps
    • (In Japanese)
    • K. Ito, Y. Kawano, and K. Noshita. On the algorithms for solving tsume-shogi with extremely long solution-steps. Journal of the Information Processing Society of Japan, 36(12):2793-2799, 1995. (In Japanese).
    • (1995) Journal of the Information Processing Society of Japan , vol.36 , Issue.12 , pp. 2793-2799
    • Ito, K.1    Kawano, Y.2    Noshita, K.3
  • 8
    • 84956865789 scopus 로고    scopus 로고
    • Tsume shogi
    • H. Matsubara and I. Takeuchi, editors, Kyoritsu Shuppan Co., Tokyo, Japan, ISBN 00110-2-57035. (In Japanese)
    • K. Ito, Y. Kawano, M. Seo, and K. Noshita. Tsume shogi. In H. Matsubara and I. Takeuchi, editors, BIT special issue: Game Programming, pages 130-138. Kyoritsu Shuppan Co., Tokyo, Japan, 1997. ISBN 00110-2-57035. (In Japanese).
    • (1997) BIT Special Issue: Game Programming , pp. 130-138
    • Ito, K.1    Kawano, Y.2    Seo, M.3    Noshita, K.4
  • 9
    • 0004832332 scopus 로고
    • Two fast programs for solving tsume-shogi and their evaluation
    • (In Japanese)
    • K. Ito and K. Noshita. Two fast programs for solving tsume-shogi and their evaluation. Journal of the Information Processing Society of Japan, 35(8):1531-1539, 1994. (In Japanese).
    • (1994) Journal of the Information Processing Society of Japan , vol.35 , Issue.8 , pp. 1531-1539
    • Ito, K.1    Noshita, K.2
  • 12
    • 0004862449 scopus 로고
    • Tokyo: Heibon-sha, ISBN 4582-80335-0. (in Japanese)
    • Y. Kadowaki. Zoku-tsumuya-tsumazaruya. Tokyo: Heibon-sha, 1978. ISBN 4582-80335-0. (in Japanese).
    • (1978) Zoku-Tsumuya-Tsumazaruya
    • Kadowaki, Y.1
  • 13
    • 0000239994 scopus 로고    scopus 로고
    • Using similar positions to search game trees
    • R.J. Nowakowski, editor, Cambridge: University Press
    • Y. Kawano. Using similar positions to search game trees. In R.J. Nowakowski, editor, Games of no chance (Combinatorial games at MSRI, Berkeley 1994), pages 193-202. Cambridge: University Press, 1996.
    • (1996) Games of No Chance (Combinatorial Games at MSRI, Berkeley 1994) , pp. 193-202
    • Kawano, Y.1
  • 19
    • 0000238476 scopus 로고    scopus 로고
    • Natural developments in game research
    • H. Matsubara, H. Iida, and R. Grimbergen. Natural developments in game research. ICCA Journal, 19(2):103-112, June 1996.
    • (1996) ICCA Journal , vol.19 , Issue.2 , pp. 103-112
    • Matsubara, H.1    Iida, H.2    Grimbergen, R.3
  • 20
    • 0024048270 scopus 로고
    • Conspiracy numbers for min-max search
    • D.A. McAllester. Conspiracy numbers for min-max search. Artificial Intelligence, 35:287-310, 1988.
    • (1988) Artificial Intelligence , vol.35 , pp. 287-310
    • McAllester, D.A.1
  • 22
    • 0004894653 scopus 로고    scopus 로고
    • A parallel algorithm for solving hard tsume shogi problems
    • June
    • Y. Nakayama, T. Akazawa, and K. Noshita. A parallel algorithm for solving hard tsume shogi problems. ICCA Journal, 19(2):94-99, June 1996.
    • (1996) ICCA Journal , vol.19 , Issue.2 , pp. 94-99
    • Nakayama, Y.1    Akazawa, T.2    Noshita, K.3
  • 24
    • 84956861446 scopus 로고
    • How to make a quick and accurate tsume-shogi solver
    • (In Japanese)
    • K. Noshita. How to make a quick and accurate tsume-shogi solver. Shingaku- Kenkyukai, COMP91, 56:29-37, 1991. (In Japanese).
    • (1991) Shingaku- Kenkyukai, COMP91 , vol.56 , pp. 29-37
    • Noshita, K.1
  • 25
    • 84956857820 scopus 로고    scopus 로고
    • The tsume shogi solver T2
    • H. Matsubara, editor, Tokyo: Kyoritsu Shuppan Co, ISBN 4-320-02799-X. (In Japanese)
    • K. Noshita. The tsume shogi solver T2. In H. Matsubara, editor, Computer Shogi Progress, pages 50-70. Tokyo: Kyoritsu Shuppan Co, 1996. ISBN 4-320-02799-X. (In Japanese).
    • (1996) Computer Shogi Progress , pp. 50-70
    • Noshita, K.1
  • 29
    • 84956854536 scopus 로고    scopus 로고
    • A tsume shogi solver using conspiracy numbers
    • H. Matsubara, editor, Tokyo: Kyoritsu Shuppan Co, ISBN 4-320-02799-X. (In Japanese)
    • M. Seo. A tsume shogi solver using conspiracy numbers. In H. Matsubara, editor, Computer Shogi Progress 2, pages 1-21. Tokyo: Kyoritsu Shuppan Co, 1998. ISBN 4-320-02799-X. (In Japanese).
    • (1998) Computer Shogi Progress , vol.2 , pp. 1-21
    • Seo, M.1
  • 30
    • 0018504934 scopus 로고
    • A minimax algorithm better than alpha-beta?
    • G. Stockman. A minimax algorithm better than alpha-beta? Artificial Intelligence, 12:179-196, 1979.
    • (1979) Artificial Intelligence , vol.12 , pp. 179-196
    • Stockman, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.