Project : http://ai.berkeley.edu/multiagent.html ###Provisional grades
Question q1: 4/4
Question q2: 5/5
Question q3: 5/5
Question q4: 5/5
Question q5: 6/6
I implemented a very basic function that just go for the closest food and avoids the ghost if very near.
These algorithms were implemented as cohesive as possible.
As Q1 but I added a few multipliers to a few variables for the final score accordingly to theirs significance.
Code is fully explained in comments.