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.

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

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．