In one of the first papers about the complexity of puzzles, Robertson and Munro [12] proved that a generalized form of the then-popular Instant Insanity puzzle is NP-complete. Here we study several variations of this puzzle, exploring how the complexity depends on the piece shapes and the allowable orientations of those shapes
We analyze the computational complexity of solving the three “temporal rift” puzzles in the recent p...
A computation consists of algorithm of basic operations. When you consider an algorithm, you assume,...
Solving paper-and-pencil puzzles is fun for people, and their analysis is also an essential issue in...
Instant Insanity II is a 4 by 4 sliding tile puzzle designed by Philip Orbanes. The packaging indica...
This paper deals with a popular puzzle known as Hi-Q. The puzzle is generalized: the board is extend...
The manufacturer claims that there is only one solution to the puzzle Instant Insanity II. However, ...
Single-player games (often called puzzles) have received considerable attention from the scientific ...
Nonograms are a popular type of logic puzzles, where a pixel grid has to be filled with black and wh...
Includes bibliographical references (pages 42-42)The natural generalization of the Instant Insanity ...
Instant Insanity consists of four cubes, each of whose six faces are colored with one of the four co...
Is it harder to solve many puzzles than it is to solve just one? This question has di#erent answers...
We prove NP-hardness of a wide class of pushing-block puzzles similar to the classic Sokoban, genera...
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For ...
Abstract. We show that the popular pencil puzzle Nurikabe is intractable from the com-putational com...
We prove that two pushing-blocks puzzles are intractable in 2D. One of our constructions improves an...
We analyze the computational complexity of solving the three “temporal rift” puzzles in the recent p...
A computation consists of algorithm of basic operations. When you consider an algorithm, you assume,...
Solving paper-and-pencil puzzles is fun for people, and their analysis is also an essential issue in...
Instant Insanity II is a 4 by 4 sliding tile puzzle designed by Philip Orbanes. The packaging indica...
This paper deals with a popular puzzle known as Hi-Q. The puzzle is generalized: the board is extend...
The manufacturer claims that there is only one solution to the puzzle Instant Insanity II. However, ...
Single-player games (often called puzzles) have received considerable attention from the scientific ...
Nonograms are a popular type of logic puzzles, where a pixel grid has to be filled with black and wh...
Includes bibliographical references (pages 42-42)The natural generalization of the Instant Insanity ...
Instant Insanity consists of four cubes, each of whose six faces are colored with one of the four co...
Is it harder to solve many puzzles than it is to solve just one? This question has di#erent answers...
We prove NP-hardness of a wide class of pushing-block puzzles similar to the classic Sokoban, genera...
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For ...
Abstract. We show that the popular pencil puzzle Nurikabe is intractable from the com-putational com...
We prove that two pushing-blocks puzzles are intractable in 2D. One of our constructions improves an...
We analyze the computational complexity of solving the three “temporal rift” puzzles in the recent p...
A computation consists of algorithm of basic operations. When you consider an algorithm, you assume,...
Solving paper-and-pencil puzzles is fun for people, and their analysis is also an essential issue in...