GitHub - ThomasLoke/unblockme: Calculates a solution for the unblockme mobile game by building up a graph that contains the adjacency relations between states, and then finds the shortest path from the initial state to the solution state using the Boost graph library.

ThomasLoke / unblockme Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Calculates a solution for the unblockme mobile game by building up a graph that contains the adjacency relations between states, and then finds the shortest path from the initial state to the solution state using the Boost graph library.

1 star 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
Documentation		Documentation
unblockme		unblockme
.gitattributes		.gitattributes
.gitignore		.gitignore
Readme.txt		Readme.txt
unblockme.sln		unblockme.sln

Repository files navigation

Brief description:
Calculates a solution for the unblockme mobile game (see https://itunes.apple.com/au/app/unblock-me-free/id315019111?mt=8) by building up a graph that contains the adjacency relations between states, and then finds the shortest path from the initial state to the solution state using the Boost graph library.

Requirements:
Main program compiled on Visual Studio 2015, although most dependencies exist in earlier version of Visual Studio as well.
Visualisation is done using Mathematica (see Documentation/unblockme.nb or its pdf version), which serves to provide the input (Documentation/problemdef.dat) and visualise the output (Documentation/unblockme_solution.gif) of the main program.

Results:
Check out the Documentation folder - the unblockme_solution.gif provides an animated gif visualizing the result.