Large peg-army maneuvers

DOI10.4230/LIPICS.FUN.2016.18MaRDI QIDQ5282816zbMATH OpenFDO

Authors Luciano Gualà, Stefano Leucci, Roberto Tauraso, Emanuele Natale

Publication date 17 July 2017

Full work available at URL https://arxiv.org/abs/1603.00898

zbMATH Keywords

complexity of gamesSolitaire Army

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial games (91A46)

Recommendations

• A fresh look at peg solitaire
• Solving triangular peg solitaire
• Solitaire army and related games
• The minimum size required of a solitaire army
• Peg solitaire on graphs

Cited in

(15)

• Solitaire lattices
• Trainyard is NP-hard
• Peg-solitaire, string rewriting systems and finite automata
• Tracks from hell -- when finding a proof may be easier than checking it
• A fresh look at peg solitaire
• Tracks from hell -- when finding a proof may be easier than checking it
• On the complexity of Two Dots for narrow boards and few colors
• On the PSPACE-completeness of Peg Duotaire and other peg-jumping games
• Diagonal peg solitaire
• The algorithmics of solitaire-like games
• scientific article; zbMATH DE number 4101193 (Why is no real title available?)
• scientific article; zbMATH DE number 1759686 (Why is no real title available?)
• Solitaire army and related games
• The minimum size required of a solitaire army
• Uniform-budget solo chess with only rooks or only knights is hard

This page was built for publication: Large peg-army maneuvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282816)