General Discussions
Discuss any topics that are not product-specific here.
Solved!
Spoiler
In Part 1, I adopted the route search algorithm A*(A star). The workflow finishes in about 1 minute.
In Part 2, after a lot of trial and error, I used an iterative macro to search from the end of the memory corruption list for the point where I finally reached the goal. The route-finding algorithm was much faster in unreachable cases, and was able to find the answer within three minutes.
Part1 macro(A* algorithm)
Part 2 macro
In Part 2, after a lot of trial and error, I used an iterative macro to search from the end of the memory corruption list for the point where I finally reached the goal. The route-finding algorithm was much faster in unreachable cases, and was able to find the answer within three minutes.
Part1 macro(A* algorithm)
Part 2 macro
Spoiler
Part 1: Starting at the end, navigate to available adjacent cells and exit the macro at the first cell.
Part 2: Not elegant, and takes forever to run, but it works. Iterate through every falling bit until a path is not found.
P1 Macro:
P2 Macro:
Part 2: Not elegant, and takes forever to run, but it works. Iterate through every falling bit until a path is not found.
P1 Macro:
P2 Macro:
