To avoid you from having to learn the whole framework for the assignment, the following are some tips to help focus your examination of the codebase.
- For tie-breaking, look at the OpenClosedList where nodes are compared when deciding on their location in the open list heap.
- For WA* and GBFS, you will want to look at the way A* is implemented.
- For the re-expansion experiments, look at the BestFirstSearch class, for how nodes are re-opened.