A Combinatorial Approach to the Solitaire Game(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• The classical game of peg solitaire has uncertain origins, but was certainly popular by the time of Louis XIV, and was described by Leibniz in 1710. One of the classical problems concerning peg solitaire is the feasibility issue. An early tool used to show the infeasibility of various peg games is the rule-of-three [Suremain de Missery 1841]. In the 1960s the description of the solitaire cone [Boardman and Conway] provides necessary conditions: valid inequalities over this cone, known as pagoda functions, were used to show the infeasibility of various peg games. In this paper, we recall these necessary conditions and present new developments: the lattice criterion, which generalizes the rule-of-three; and results on the strongest pagoda functions, the facets of the solitaire cone.

• 社団法人電子情報通信学会の論文
• 2000-04-25

著者

• Avis David

  The Author Is With The School Of Computer Science Mcgill University Montreal

• DEZA Antoine

  The author is with the Department of Mathematical and Computing Sciences, Tokyo Institute of Technol

• ONN Shmuel

  The author is with the Davidson Faculty of IE & M, Technion-Israel Institute of Technology

• Onn Shmuel

  The Author Is With The Davidson Faculty Of Ie & M Technion-israel Institute Of Technology

• Deza Antoine

  The Author Is With The Department Of Mathematical And Computing Sciences Tokyo Institute Of Technolo

関連論文

• A Combinatorial Approach to the Solitaire Game(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク