{"ref":null,"ref_type":"repository","master_branch":"master","description":"This program uses A* pathfinding in order to find the minimum number of moves necessary to convert a sliding tile puzzle in an initial configuration into a goal configration. The program also lists the necessary moves for the 0 position in order to reach the goal configuration.","pusher_type":"user"}
{"actor":{"display_login":"Vandy225"}}