time java-algs4 Solver puzzle3x3-28.txt
Minimum number of moves = 28
3
6 3 8
5 4 1
7 2 0
3
6 3 8
5 4 0
7 2 1
3
6 3 0
5 4 8
7 2 1
3
6 0 3
5 4 8
7 2 1
3
6 4 3
5 0 8
7 2 1
3
6 4 3
5 2 8
7 0 1
3
6 4 3
5 2 8
0 7 1
3
6 4 3
0 2 8
5 7 1
3
0 4 3
6 2 8
5 7 1
3
4 0 3
6 2 8
5 7 1
3
4 2 3
6 0 8
5 7 1
3
4 2 3
0 6 8
5 7 1
3
4 2 3
5 6 8
0 7 1
3
4 2 3
5 6 8
7 0 1
3
4 2 3
5 0 8
7 6 1
3
4 2 3
5 8 0
7 6 1
3
4 2 3
5 8 1
7 6 0
3
4 2 3
5 8 1
7 0 6
3
4 2 3
5 0 1
7 8 6
3
4 2 3
5 1 0
7 8 6
3
4 2 0
5 1 3
7 8 6
3
4 0 2
5 1 3
7 8 6
3
4 1 2
5 0 3
7 8 6
3
4 1 2
0 5 3
7 8 6
3
0 1 2
4 5 3
7 8 6
3
1 0 2
4 5 3
7 8 6
3
1 2 0
4 5 3
7 8 6
3
1 2 3
4 5 0
7 8 6
3
1 2 3
4 5 6
7 8 0
real 0m0.198s
user 0m0.297s
sys 0m0.033s
This repository has been archived by the owner on Oct 13, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Solving 8Puzzle by using a Min PriorityQueue.
License
0x0584/8puzzle
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Solving 8Puzzle by using a Min PriorityQueue.