A survey of NP-complete puzzles

G Kendall, A Parkes, K Spoerer - ICGA Journal, 2008 - content.iospress.com
Single-player games (often called puzzles) have received considerable attention from the
scientific community. Consequently, interesting insights into some puzzles, and into the …

Large peg-army maneuvers

L Gualà, S Leucci, E Natale, R Tauraso - arXiv preprint arXiv:1603.00898, 2016 - arxiv.org
Despite its long history, the classical game of peg solitaire continues to attract the attention
of the scientific community. In this paper, we consider two problems with an algorithmic …

The minimum size required of a solitaire army

GI Bell, DS Hirschberg, P Guerrero-Garcia - arXiv preprint math/0612612, 2006 - arxiv.org
The solitaire army is a one-person peg jumping game where a player attempts to advance
an" army" of pegs as far as possible into empty territory. The game was introduced by John …

[PDF][PDF] The Lemmings puzzle: computational complexity of an approach and identification of difficult instances

K Spoerer - 2007 - Citeseer
Artificial Intelligence can be thought of as the study of machines that are capable of solving
problems that require human level intelligence. It has frequently been concerned with game …

Zero-Knowledge Proof of Knowledge for Peg Solitaire

X Bultel - 11th International Conference on Fun with Algorithms …, 2022 - hal.science
Peg solitaire is a very popular traditional single-player board game, known to be NP-
complete. In this paper, we present a zero-knowledge proof of knowledge for solutions of …

[PDF][PDF] Detecting Unsolvability Based on Parity Functions

R Christen - 2021 - ai.dmi.unibas.ch
Unsolvability is an important result in classical planning and has seen increased interest in
recent years. This thesis explores unsolvability detection by automatically generating parity …

[PDF][PDF] Graph Theorizing Peg Solitaire

DP Hoilman - 2010 - oupub.etsu.edu
We begin by introducing a variety of terms necessary to further investigate the problem. First
and foremost, a graph is a mathematical relationship consisting of a nonempty finite set V of …

SOLO TEST OYUNU ÜZERİNDE KUYRUK LİSTESİ İLE BİR PARALEL ÖNCE-DERİNE ARAMA ALGORİTMASI

M Doğan - Anadolu University Journal of Science and Technology …, 2015 - dergipark.org.tr
Solo Test oyununda tablada tek taşın kaldığı duruma ulaşmak için takip edilmesi gereken
hamleler, DFS algoritmasıyla günümüz bilgisayarlarında kısa sürede bulunabilmektedir. Bu …

[PDF][PDF] ARAŞTIRMA MAKALESİ/RESEARCH ARTICLE

STOÜK LİSTESİ, İ PARALEL, ÖDA ALGORİTMASI - researchgate.net
ABSTRACT For the Peg Solitaire game, existing computers can easily compute the moves
required to obtain the solution board with one peg in a short time by applying the DFS …

[PDF][PDF] 解けないパズルをLP で解く

松井知己 - オペレーションズ・リサーチ, 2008 - tomomi.my.coocan.jp
ペグソリティアというパズルを御存知だろうか? 図 1 のような穴の開いた盤にペグを刺して遊ぶ
パズルである. 図 1 中の黒丸 (白丸) は, ペグが刺さっている (いない) ことを表している …