I. Oska Today we introduced the game of Oska, which you then learned would be your term project. The game is explained in great detail in the accompanying powerpoint slides, and there will be more specifics about the term project requirements in the days to come. II. Heuristic depth-first search When the excitement of the term project died down, we returned to the more mundane world of graph search and talked about heuristic depth-first search. The algorithm and an example is, as usual, to be found in the slides. The search behavior itself doesn't look too impressive, but the value in heuristic depth-first search becomes more apparent when you look at its space requirements, which for many of the search strategies are exponential in terms of the path length. In the case of heuristic depth-first search, however, the search requirements are merely linear.
Last revised: October 30, 2004