I once used genetic algorithms for path planning where A* would do. While it was fun to implement, the scoring was based on "goodness of path found in time X" ... I didn't get a very high score on that homework.
On the other hand, I got a surprisingly high score for what was essentially "random guessing until you run out of time".
I once used genetic algorithms for path planning where A* would do. While it was fun to implement, the scoring was based on "goodness of path found in time X" ... I didn't get a very high score on that homework.
On the other hand, I got a surprisingly high score for what was essentially "random guessing until you run out of time".