This puzzle stems from these kind of questions by Dmitry Kamenetsky.
Creating the toughest 7×7 maze
Creating the toughest 6×6 maze
I wished to understand how the absolute best answer would change, if I have been so as to add in particular squares with completely different results. I’ve some extra concepts I wish to attempt if individuals like this type of puzzle.
There may be an empty 7×7 grid. You’re allowed to color a few of its cells as partitions (black), whereas the remaining cells are both empty(white) or maintain a particular piece. A robotic is programmed to start out on the Begin(inexperienced) sq. and go to all the objective(purple) squares utilizing the shortest path attainable. The sport is over as soon as the robotic touches the final objective, it doesn’t have to return to start out. The robotic mechanically is aware of the shortest path (together with the results of the particular squares) and its choices can’t be influenced. The robotic strikes from one empty cell to an adjoining empty cell (Horizontally or vertically, however not diagonally). The particular squares are 2 x slide squares(purple, with an arrow) and a couple of x slowing squares(blue). Particular squares can’t be positioned on beginning squares or objective squares. Are you able to paint the partitions and add the particular squares in a approach that forces the robotic to take the most variety of steps?
Map:
Slide Squares:
The robotic counts the slide as part of transferring onto the sq.. You might enter any route besides immediately reverse of the arrow, and the spot immediately reverse of the arrow should not be a wall. The robotic will slide the route the arrow is pointing. As soon as the slide has been used as soon as, it disappears and you could return throughout it in any route. Right here, it might take 3 strikes to achieve the objective, however 4 strikes if it wished to go from objective to start out afterwards.
Slowing Squares: The robotic counts this sq. as 2 strikes. You might enter/exit from any route and it has infinite makes use of. Right here, It will take the robotic 5 strikes to achieve the objective, and nonetheless 5 if it wished to go from objective to start out afterwards.
Create the longest answer that visits all targets utilizing 2 x Slowing and a couple of x Slide squares. Good Luck!
