3 research outputs found
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games
Peg Duotaire is a two-player version of the classical puzzle called Peg Solitaire. Players take turns making peg-jumping moves, and the first player which is left without available moves loses the game. Peg Duotaire has been studied from a combinatorial point of view and two versions of the game have been considered, namely the single- and the multi-hop variant. On the other hand, understanding the computational complexity of the game is explicitly mentioned as an open problem in the literature. We close this problem and prove that both versions of the game are PSPACE-complete. We also prove the PSPACE-completeness of other peg-jumping games where two players control pegs of different colors
Peg Solitaire on Graphs In Which We Allow Merging and Jumping
Peg solitaire is a game in which pegs are placed in every hole but one and the player jumps over pegs along rows or columns to remove them. Usually, the goal of the player is to leave only one peg. In a 2011 paper, this game is generalized to graphs. In this thesis, we consider a variation of peg solitaire on graphs in which pegs can be removed either by jumping them or merging them together. To motivate this, we survey some of the previous papers in the literature. We then determine the solvability of several classes of graphs including stars and double stars, caterpillars, trees of small diameter, particularly four and five, and articulated caterpillars. We conclude this thesis with several open problems related to this study
Master index
Pla general, del mural cerĂ mic que decora una de les parets del vestĂbul de la Facultat de QuĂmica de la UB. El mural representa diversos sĂmbols relacionats amb la quĂmica