Today we implemented the algorithm that makes the robot return home after it finds the gold.
Some slight optimizations used to accomplish this:
- Keep track of all the tiles the robot has been to
- Thanks Bram for the idea! :)
- Implement a way to determine whether or not the gold has been found
- Either True or False
While the robot still hasn't found gold, it will prioritize moving to tiles that it hasn't been to yet, so it is able to explore the board in a more efficient manner. We can accomplish this by making our robot choose from a list of adjacent tiles that have been deemed safe. If there is more than one tile that the robot can choose from, it will always go with the first option.
When ARA-24 finds gold, it retraces its steps by moving to the tiles it has been to in reverse order, which guarantees that the spaces it "walks on" are safe.
A problem we encountered today:
- This process is not very efficient!
Some plans for next time (or sometime in the near future):
- Optimize this process
- Implement some way to visualize the object list (this will make debugging slightly easier!)
Comments