# Return to Answer

 5 added 55 characters in body edited Jul 16 '15 at 17:11 Nautilus 4,32066 silver badges2626 bronze badges You first assume the walls are placed in a certain way. Then you start making assumptions about where you are and make sure the robot can travel through all the squares based on these assumptions. If you can't reach the end on the very first try (after this list of moves), you assume you were on a different square from what you chose at first and calculate your current "starting" pos based on that. After every failed attempt, you assume you were on a different square at the very beginning and calculate your new starting position based on that. If this scenario (assumed combination of walls, not the starting position) never succeeds, start anew in another scenario. Eventually the robot will succeed. You first assume the walls are placed in a certain way. Then you start making assumptions about where you are and make sure the robot can travel through all the squares based on these assumptions. If you can't reach the end on the very first try (after this list of moves), you assume you were on a different square from what you chose at first and calculate your current "starting" pos based on that. After every failed attempt, you assume you were on a different square at the very beginning. If this scenario (assumed combination of walls, not the starting position) never succeeds, start anew in another scenario. Eventually the robot will succeed. You first assume the walls are placed in a certain way. Then you start making assumptions about where you are and make sure the robot can travel through all the squares based on these assumptions. If you can't reach the end on the very first try (after this list of moves), you assume you were on a different square from what you chose at first and calculate your current "starting" pos based on that. After every failed attempt, you assume you were on a different square at the very beginning and calculate your new starting position based on that. If this scenario (assumed combination of walls, not the starting position) never succeeds, start anew in another scenario. Eventually the robot will succeed. 4 added 27 characters in body edited Jul 16 '15 at 16:23 Nautilus 4,32066 silver badges2626 bronze badges You first assume the walls are placed in a certain way. Then you start making assumptions about where you are and make sure the robot can travel through all the squares based on these assumptions. If you can't reach the end on the very first try (after this list of moves), you assume you were on a different square from what you chose at first and calculate your current "starting" pos based on that. After every failed attempt, you assume you were on a different square at the very beginning. If this scenario (assumed combination of walls, not the starting position) never succeeds, start anew in another scenario. Eventually the robot will succeed. You first assume the walls are placed in a certain way. Then you start making assumptions about where you are and make sure the robot can travel through all the squares based on these assumptions. If you can't reach the end on the very first try, you assume you were on a different square from what you chose at first and calculate your current "starting" pos based on that. After every failed attempt, you assume you were on a different square at the very beginning. If this scenario (assumed combination of walls, not the starting position) never succeeds, start anew in another scenario. Eventually the robot will succeed. You first assume the walls are placed in a certain way. Then you start making assumptions about where you are and make sure the robot can travel through all the squares based on these assumptions. If you can't reach the end on the very first try (after this list of moves), you assume you were on a different square from what you chose at first and calculate your current "starting" pos based on that. After every failed attempt, you assume you were on a different square at the very beginning. If this scenario (assumed combination of walls, not the starting position) never succeeds, start anew in another scenario. Eventually the robot will succeed. Post Undeleted by Nautilus occurred Jul 16 '15 at 15:51 3 added 46 characters in body edited Jul 16 '15 at 15:49 Nautilus 4,32066 silver badges2626 bronze badges At worst we can write our barebones part(s) thatYou first assume the walls are placed in a certain way. Then you start making assumptions about where you are and make sure the robot can normally travel through all the squares inbased on these assumptions. If you can't reach the absence of wallsend on the very first try, then accounting for wallsyou assume you were on a different square from what you chose at first and calculate your current "starting" pos based on that. After every failed attempt, have it go back to the startingyou assume you were on a different square each time by writingat the opposite directions after 399 movesvery beginning. We later add all the other "scenarios" allowing us to travel through all the squares in a givenIf this scenario (assumed combination of walls, not the starting position) never succeeds, start and end squaresanew in a certain position. Between eachanother scenario, we always make it return to the starting square. Eventually one of those "attempts"the robot will be successfulsucceed. At worst we can write our barebones part(s) that can normally travel through all the squares in the absence of walls first, then accounting for walls, have it go back to the starting square each time by writing the opposite directions after 399 moves. We later add all the other "scenarios" allowing us to travel through all the squares in a given combination of walls, start and end squares in a certain position. Between each scenario, we always make it return to the starting square. Eventually one of those "attempts" will be successful. You first assume the walls are placed in a certain way. Then you start making assumptions about where you are and make sure the robot can travel through all the squares based on these assumptions. If you can't reach the end on the very first try, you assume you were on a different square from what you chose at first and calculate your current "starting" pos based on that. After every failed attempt, you assume you were on a different square at the very beginning. If this scenario (assumed combination of walls, not the starting position) never succeeds, start anew in another scenario. Eventually the robot will succeed. Post Deleted by Nautilus occurred Jul 16 '15 at 14:44 2 added 23 characters in body edited Jul 16 '15 at 14:33 Nautilus 4,32066 silver badges2626 bronze badges 1 answered Jul 16 '15 at 13:54 Nautilus 4,32066 silver badges2626 bronze badges