Add to ORKGThis paper deals with a popular puzzle known as Hi-Q. The puzzle is generalized: the board is extended to the size n × n, an initial position of the puzzle is given, and a place is given on which only one token is finally placed. The complexity of the generalized Hi-Q is proved NP-complete
A problem is in the class NP when it is possible to compute in polynomial time that a given solution...
International audienceThe game of Go is often said to exptime-complete. The result refers to classic...
Nonograms are a popular type of logic puzzles, where a pixel grid has to be filled with black and wh...
In a Hiroimono puzzle, one must collect a set of stones from a square grid, moving along grid lines,...
In one of the first papers about the complexity of puzzles, Robertson and Munro [12] proved that a g...
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For ...
Introduction Chapter 5: NP-completeness 5.1 Introduction In the previous chapter we met two compu...
A computation consists of algorithm of basic operations. When you consider an algorithm, you assume,...
Rikudo is a number-placement puzzle, where the player is asked to complete a Hamiltonian path on a h...
AbstractWe prove NP-hardness of six families of naturally defined, interesting board games. Some of ...
When analyzing the computational complexity of well-known puzzles, most papers consider the algorith...
In this thesis we explore a number of ways in which combinatorial games can be used to help prove re...
Abstract. Tiling planar regions with dominoes is a classical problem in which the decision and count...
This thesis is mainly concerned with the structural complexity of the Boolean Hierarchy. The Boolean...
Abstract. We show that the popular pencil puzzle Nurikabe is intractable from the com-putational com...
A problem is in the class NP when it is possible to compute in polynomial time that a given solution...
International audienceThe game of Go is often said to exptime-complete. The result refers to classic...
Nonograms are a popular type of logic puzzles, where a pixel grid has to be filled with black and wh...
In a Hiroimono puzzle, one must collect a set of stones from a square grid, moving along grid lines,...
In one of the first papers about the complexity of puzzles, Robertson and Munro [12] proved that a g...
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For ...
Introduction Chapter 5: NP-completeness 5.1 Introduction In the previous chapter we met two compu...
A computation consists of algorithm of basic operations. When you consider an algorithm, you assume,...
Rikudo is a number-placement puzzle, where the player is asked to complete a Hamiltonian path on a h...
AbstractWe prove NP-hardness of six families of naturally defined, interesting board games. Some of ...
When analyzing the computational complexity of well-known puzzles, most papers consider the algorith...
In this thesis we explore a number of ways in which combinatorial games can be used to help prove re...
Abstract. Tiling planar regions with dominoes is a classical problem in which the decision and count...
This thesis is mainly concerned with the structural complexity of the Boolean Hierarchy. The Boolean...
Abstract. We show that the popular pencil puzzle Nurikabe is intractable from the com-putational com...
A problem is in the class NP when it is possible to compute in polynomial time that a given solution...
International audienceThe game of Go is often said to exptime-complete. The result refers to classic...
Nonograms are a popular type of logic puzzles, where a pixel grid has to be filled with black and wh...