Puzzle-Problem

A* Algorithm

Choose either 2x2-puzzle or 3x3-puzzle.

Runs Left

Output

1	2
3

**Initial-Puzzle(2x2)**
1	2
3

**Moves =**
3	2
1

**Goal-State(2x2)**
1	2
3

Congratulations!
Completed in moves!
(Check out the fastest solution by clicking the button below.)

Solution(2x2)
Moves =

Minimum moves are required.

×

Enter numbers in row-major order(eg:145607832).
*'0' representing the empty tile