Skip to content
The goal of this project is to solve the N-puzzle ("taquin" in French) game using the A* search algorithm or one of its variants.
Go Python Shell
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
digits Add option digit to the picture Jul 11, 2019
images poney Jul 17, 2019
maps clean Jul 18, 2019
.gitignore
N-Puzzle
README.md edit time Aug 1, 2019
algo.go
go.mod long loop... Jul 10, 2019
go.sum long loop... Jul 10, 2019
graphic.go block man if bot Jul 29, 2019
main.go tweak W Jul 26, 2019
mapGenerator.py solvability mon amour Jul 12, 2019
map_builder.go graph opt + linearconflicts fixed Jul 13, 2019
n_puzzle.gif gif Aug 1, 2019
parser.go correct error : when a comment is just after the size value Jul 29, 2019
tests.sh Added options Jul 6, 2019
utils.go

README.md

N-Puzzle

The goal of this project is to solve the N-puzzle ("taquin" in French) game using the A* search algorithm or one of its variants.

We use and dynamically Weighted IDA* to solve the problem with the best solution in a 5s time interval, if time exceed 10s, then Weight is incremented, and so on...

Usage:

Build :

go build

Run

./N-Puzzle[.exe] [-m mapFile] [-i imageFile] [-d difficulty] [-a heuristic] [-gs] [-g] [-dg]
			-m mapFile    = 'map_file.map'
			-i imageFile  = 'image_file.png'
			-s size       = map size (int)
			-h heuristic  = 'heuristic' ('md' (default), 'hd', 'ed', 'lc')
			-gs           = Greedy Search (cost g(x) = 0)
			-g            = Graphical Interface
			-dg           = Add numbers to the picture
You can’t perform that action at this time.