Sarah Darwiche

/*****************************************************************************************
*** About
****************************************************************************************/

Dijkstra's shortest path algorithm implemented with snakes and ladders.
Includes a visual representation of the solution.

/*****************************************************************************************
*** To run
****************************************************************************************/

snl > gamefile.txt

/*****************************************************************************************
*** Input Format
****************************************************************************************/

i - number of games
N (game size, will be N*N board)
ladder count
snake count
ladder start index, ladder end index (repeated ladder count times)
snake start index, snake end index (repeated snake count times)

/*****************************************************************************************
*** Output Format
****************************************************************************************/

Board Game #
Steps taken to reach finish point (n by n index).
A plus represents a ladder being utilized.

For visuals http://www.graphviz.org

/*****************************************************************************************
*** End
****************************************************************************************/