Author: Unknown
Subject: Printing items in Correct Order
Date: Monday, 13 Apr 2020, 23:02:02

My algorithm currently finds the output in the correct number of steps (when I compare it to the -r version of your Nine20), however I am very confused on how to recurse to print out the strings in correct order (considering we only know the position, the reached-from of that final position, and nsteps). I get that we can recurse and make the "reached-from" the "position" and do nsteps-1 in the next call, but how do we find the next reached-from?