| |
The AI aspect of this program is called heuritists (ordered searching), which determines the best path. The mouse and cheese program is very basic, but illustrates the search principle. This example is based on a program by M. Steuben.
In comparison, ordered search trees have lookup and insertion cost proportional to log(n), but allow finding the nearest key at about the same cost, and ordered enumeration of all entries at constant cost per entry.
 See also: AI
  
|
RSS
