df-pnアルゴリズムの詰将棋を解くプログラムへの応用  [in Japanese] Application of df-pn Algorithm to a Program to Solve Tsume-shogi Problems  [in Japanese]

Access this Article

Search this Article

Author(s)

Abstract

詰将棋を解くプログラムの研究はこの10年の間に大きく進歩した.その原動力となったのは,証明数や反証数という概念の導入である.詰将棋に適用すると,直感的にいうと,証明数は玉の逃げ方の総数を,反証数は攻め方の王手の総数を表す.前者は攻め方にとって,後者は玉方にとって非常に重要な値である.証明数・反証数を対等に扱った,最もナイーブなアルゴリズムは,Allisによるpn-searchという最良優先探索法である.我々は近年,df-pnアルゴリズムという,pn-searchと同等の振舞いをする深さ優先探索法を提案している.この論文では,df-pnアルゴリズムを用いて詰将棋を解く強力なプログラムを作成し,その過程で導入した様々な技法を提案する.これらの技法をdf-pnの上に実装することにより,我々のプログラムでは300手以上の詰将棋のすべてを解くことに初めて成功した.しかもそれは,シングルプロセッサのワークステーションで解くなど,解答能力と解答時間の両面で優れた結果を出すことができた.During this decade, a study of programs to solve Tsume-Shogi problemshas greatly advanced. This is due to the development ofthe concept of a proof number and a disproof number.Allis' pn-search is the most naive best-first algorithm that usesboth proof numbers and disproof numbers on equal terms.We already developed a df-pn algorithm which is a depth-firstalgorithm that behaves the same as pn-search.In this paper, we applied df-pn algorithm to a program solvingTsume-Shogi problems. Moreover, we propose some techniqueswhich we imported during implementing the program.As a result, by these techniques implemented on df-pn,our program solved all the Tsume-Shogi problems,for the first time, that require over 300 plies to reach to the checkmate.

During this decade, a study of programs to solve Tsume-Shogi problems has greatly advanced. This is due to the development of the concept of a proof number and a disproof number. Allis' pn-search is the most .naive best-first algorithm that uses both proof numbers and disproof numbers on equal terms. We already developed a df-pn algorithm which is a depth-first algorithm that behaves the same as pn-search. In this paper, we applied df-pn algorithm to a program solving Tsume-Shogi problems. Moreover, we propose some techniques which we imported during implementing the program. As a result, by these techniques implemented on df-pn, our program solved all the Tsume-Shogi problems, for the first time, that require over 300 plies to reach to the checkmate.

Journal

  • Transactions of Information Processing Society of Japan

    Transactions of Information Processing Society of Japan 43(6), 1769-1777, 2002-06-15

    Information Processing Society of Japan (IPSJ)

References:  18

Cited by:  9

Codes

  • NII Article ID (NAID)
    110002726401
  • NII NACSIS-CAT ID (NCID)
    AN00116647
  • Text Lang
    JPN
  • Article Type
    Journal Article
  • ISSN
    1882-7764
  • NDL Article ID
    6188834
  • NDL Source Classification
    ZM13(科学技術--科学技術一般--データ処理・計算機)
  • NDL Call No.
    Z14-741
  • Data Source
    CJP  CJPref  NDL  NII-ELS  IPSJ 
Page Top