/INFO6205_217

Primary LanguageJavaMIT LicenseMIT

INFO6205_217

Team member:

Haoyu Yin NUID: 001875345
Jianxi Li NUID: 001824796
Mingguan Liu NUID: 001816222

Problem Describe:

Robi is a self-directed robot and its task is to pick up the garbage in a M*M map. In this game Robi have a limited steps of movements. In the limited movements Robi need to get a grade as high as possible. image

Unfortunately, Robi is only able to observe the 5 grid around him. The UP, DOWN, LEFT, RIGHT and the grid the robot is staying.

image

Our goal is helping Robi find the best route(strategy) to get the heightest score(collect all soda cans without hitting walls and picking up nothing) by using Genetic Algorithms.

TestCase Screen Shot

image image