Utilizing search algorithms and learning search hueristics to avoid dangers on a flat map and pick up as many high value items as possible given a certain amount of time. Additional challenges can be added (crafting, dodgin certain map areas) and can be solved with the learned hueristic.
Learning Search Hueristic: An Experience Graph GE is essentially a collection of previously planned paths. The E-graph planner uses weighted A* to search the original search space G.
The AI’s performance will be evaluated based on the success to find high value items and avoid dangers in a limited amount of time.
Wed, Apr 24, 4:45PM