Description: Program implements graphs algorihtms to solve fifteen puzzle problem (http://en.wikipedia.org/wiki/Fifteen_puzzle). There are few methods BFS - Hamming and Manhattan heuristics, Breadth-first search and Depth-first search. You can implement A* algorithm by changing Best First Search algorithm.
To Search:
File list (Check if you may need any files):
SISE_zad1.suo
SISE_zad1.sln
.........\debugCode.txt
.........\examplePuzzle.txt
.........\fifteenEdge.h
.........\fifteenGraph.h
.........\fifteenNode.h
.........\fifteenpuzzle.h
.........\graph.cpp
.........\main.cpp
.........\puzzlegraph.h
.........\SISE_zad1.vcxproj
.........\SISE_zad1.vcxproj.filters
.........\SISE_zad1.vcxproj.user
.........\XGetopt.cpp
.........\XGetopt.h
SISE_zad1
Download