N-Puzzle - Tristan Penman
WEBN-Puzzle supports three different Heuristic Functions: Euclidean Distance; Manhattan Distance (City-Block distance) Tiles Out-of-place; Single-Step or Burst Mode. N-Puzzle can be used in two modes. The default is Single-Step mode, which allows you to 'rewind' a search, one step at a time.
N Puzzle Solver
WEBThe N-puzzle, also known as the sliding puzzle, is a classic puzzle game that involves a square grid with numbered tiles. The goal is to rearrange the tiles from a given scrambled state to a specific target state by sliding them into the empty space one move at a time.
N-Puzzle - GitHub
WEBN-Puzzle is a web app for learning about graph-based search algorithms. We use the 8-puzzle, which is an instance of the Sliding Puzzle problem, where eight tiles are placed on a 3x3 grid. The remaining position is an empty space.
N-Puzzle Game
WEBEnter game state, from top-left to right-bottom (do not forget '-' between numbers)
N Puzzle
WEBPlay random game. Developed by Oleksandr Baletskyi.
N-Puzzle Problem Benchmarks - University of Minnesota Duluth
WEBN-Puzzle Problem Benchmarks. The 8-puzzle is one of a general class of N-puzzles which also includes the 15-puzzle. The goal state of the 15-puzzle is shown below along with the 8-puzzle. 8-puzzles and 15-puzzles of increasing complexity are used as benchmark tests for various search algorithms.
15 puzzle - Wikipedia
WEBThe 15 puzzle (also called Gem Puzzle, Boss Puzzle, Game of Fifteen, Mystic Square and more) is a sliding puzzle. It has 15 square tiles numbered 1 to 15 in a frame that is 4 tile positions high and 4 tile positions wide, with one unoccupied position.
Free Online Jigsaw Puzzles
WEBMillions of free jigsaw puzzles created by a large community. Create, play, share jigsaw puzzles and compete with other users.
GitHub - asarandi/n-puzzle: My n-puzzle solver: A* and IDA
WEBMy n-puzzle solver: A* and IDA* search, heuristics, different puzzle configurations and sizes
N-puzzle - GitHub Pages
WEBPuzzle configuration. Puzzle type: 3x3. 4x4. Algorithm type: A*. Heuristic type: Manhattan distance. Linear conflicts.