Implementing an OpenSet for AI search algorithms

2019-01-31 Nick Larsen

Today we fixed our OpenSet implementation and chatted a bit about some myths about AI in general. We had a fair amount of dicussion today and it was blast! Sorting out the details of the open set required using two collections, one to quickly load up the min item, and another to maintain a fast lookup of state costs. This class ended up being a fairly typical programming exercise and you can watch me go through various phases of frustration and raw joy as we finally got it working.

With this done, we spent a fair amount of time grinding through some example problems to see how the heuristics affect the number of nodes you have to explore in order to find the goal. Tomorrow we'll see if we can ramp up the difficulty by increasing the size of the board.