This is AMC (Advanced Math(s) Challenge) #6. [CLOSED] It is loosely based on the excellent game Qualio: https://scratch.mit.edu/projects/103091739/ The challenge is to insert code (into a remixed version of this project) that will generate a path from square 1 to square 64, following these rules: 1. Path must visit each highlighted square once and once only. 2. Path must not visit any other square. 3. Each move must be up, down left or right (no diagonal moves, no moving more than one square at a time). Use the SOLVER sprite. It has two lists. The items in the "grid" list tell you whether each square is highlighted (1 if so, 0 if not). E.g. item number 64 is "1", telling you that square number 64 is highlighted. The "SOLUTION" list is where you put your computed answer. It represents the order in which squares are visited by your path: e.g. if the first four items in the list are 1, 2, 3 and 11 those are the first four squares visited, in that order. The first item should always be 1 and the last always 64. More details at: https://scratch.mit.edu/discuss/topic/238212/
