Useful tool for https://hack.ainfosec.com/
Solver for slide puzzle.
Note that not every NxN puzzle is solvable. But this solver can solve every solvable puzzle with different sizes in limited time.
More stable than DFS or A-star algorithm, instead of efficient.
const { solve } = require('slide-puzzle-solver')
// 'X' stands for the empty slot
const puzzle = [
[1, 4, 3],
[8, 7, 6],
[2, 'X', 5],
]
// The solution will be saved here
// Valid moves are 'L', 'R', 'U', 'D' to move the 'X' piece Left, Right, Up, and Down respectively
const steps = []
// Returns the solved puzzle, while the origin `puzzle` will not be changed
const solvedPuzzle = solve(puzzle, steps)