Experimental Challenge (beta)
This challenge is still experimental. If you encounter any bugs or wrong behaviour in the environment please report the bug to the Tawfiq Jawhar at
tjawhar [at] dawsoncollege.qc.ca
In this super challenge, we have the same requirements with one change to the environment. Every time the coins are collected, the top wall shifts either to the left or the right by some random amount, changing the distance of the gap between the two walls. Once all the coins are collected, the robot will automatically reset its position. For the class challenge the focus was on optimizing your strategy for time. In this super challenge the focus shifts to the principle of generalizablity. See if you can design an algorithm that generalizes.
Instructions
Design an algorithm that cycles at least 3 times through this environment, collecting all coins at each cycle. Your strategy should generalize an approach to turning from the top wall to the right wall regardless of the distance of the gap.