[next] [prev] [prev-tail] [tail] [up]

List of Figures

2.1 A directed graph (or tree) representation is shown on the left and a two-dimensional grid (or maze) representation is shown on the right. In both representations, the letter R is used to represent the current position (or reference point) and the arrowheads indicate legal moves generated by a search operator. In the maze representation, the two grid cells are marked with an X indicate that a search operator cannot generate this grid location.
2.2 UML class diagram for the maze search Java classes
2.3 Using depth first search to find a path in a maze finds a non-optimal solution
2.4 Using breadth first search in a maze to find an optimal solution
2.5 UML class diagram for the graph search classes
2.6 Using depth first search in a sample graph
2.7 Using breadth first search in a sample graph
2.8 Alpha-beta algorithm applied to part of a game of tic-tac-toe
2.9 UML class diagrams for game search engine and tic-tac-toe
2.10 UML class diagrams for game search engine and chess
3.1 Overview of how we will use PowerLoom for development and deployment

[next] [prev] [prev-tail] [front] [up]