Skip to content

Implementation of A Star algorithm to solve sliding puzzles

Notifications You must be signed in to change notification settings

mli42/at42npuzzle

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

59 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

N-PUZZLE

The goal of this project is to solve the N-puzzle game using the A* search algorithm or one of its variants.

Usage

Flags for n-puzzle:

	[--help]
	[--file/-f=] (incompatible with -s/-u/-i)
	[--size/-s=] (3 < x < 9) (incompatible with -f)
	[--heuristic/-h=] {manhattan, misplaced, conflicts, euclidian, custom}
	[--unsolvable/-u=] (bool) (incompatible with -f)
	[--visualizer/-v=] (bool)
	[--greedy/-g=] (bool) (incompatible with -c)
	[--cost/-c=] (bool) (incompatible with -g)
	[--iteration/-i=] (0 < x < 100000) (incompatible with -f)

Sources

Heuristics

Solvability

Data Structure

Bonuses

About

Implementation of A Star algorithm to solve sliding puzzles

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published