15 puzzle solver: Difference between revisions

no edit summary
(Created a rust implementation from scratch that is understandable as the A* Algorithm)
No edit summary
Line 2:
Your task is to write a program that finds a solution in the fewest moves possible single moves to a random [[wp:15_puzzle|Fifteen Puzzle Game]].<br />
For this task you will be using the following puzzle:<br />
<pre>155 141 14 68
9 116 43 1211
0 10 2 7 15 3 7
13 814 512 20</pre>
<br />
Solution:<pre>