The Fifteen Puzzle problem is one of the most classical problems that has captivated
mathematics enthusiasts for centuries. This is mainly because of the huge size of the state …

Best-first search usually has exponential space requirements on difficult problems. Depth-
first search can solve difficult problems with linear space requirements, but it cannot utilize …

The 8-puzzle problem is a classic benchmark problem in artificial intelligence and computer
science, which involves finding the optimal sequence of moves to transform an initial state of …

Heuristic search is used in many problems and applications, such as the 15 puzzle problem,
the travelling salesman problem and web search engines. In this paper, the A* heuristic …

The 8 Puzzle is a simple game, but one with a state space large enough to warrant the use
of heuristic search, as opposed to an exhaustive or blind search. The A* algorithm is …

In this paper we propose a two-phase approach to solve the Eternity-II puzzles mainly based
on the tabu search algorithm. The first phase solves the outside region of the puzzle, and …

The N-puzzle problem is one of the most classical problems in mathematics. Since the
number of states in the N-puzzle is equal to the factorial of the number of tiles, traditional …

We have found the rst optimal solutions to a complete set of random instances of the Twenty-
Four Puzzle, the 5 5 version of the well-known sliding-tile puzzles. Our new contribution to …

The 8-puzzle is a sliding puzzle that consists of a frame of numbered square tiles in random
order with one tile missing. The more general n-puzzle is a classical problem which can be …

Number Link is a Japanese logic puzzle where pairs of same numbers are connected using
lines. Number Link can be regarded as a dynamic multiple travelers, multiple entries and …