C D E G I L M P Q S T

C

childClone() - Method in class SearchNode

childClone - returns a clone of this node that has been made a child of this node and has a depth one greater than this.

clone() - Method in class LightsOutNode

clone() - Method in class PegSolitaireNode

clone - return a copy of this node.

clone() - Method in class SearchNode

clone - see Main (pp.

D

depth - Variable in class SearchNode

variable depth - search depth; 0 at the root search node; a child node has its parent node depth + 1.

E

equals(Object) - Method in class LightsOutNode

equals(Object) - Method in class PegSolitaireNode

The equals method is especially useful for repeated state detection.

equals(Object) - Method in class SearchNode

equals - test for equality.

expand() - Method in class LightsOutNode

expand() - Method in class PegSolitaireNode

expand - return a (possibly empty) Vector of this node's children

expand() - Method in class SearchNode

expand - return a (possibly empty) Vector of this node's children.

G

getFront() - Method in class Queue

getFront - Remove and return the front item of the queue.

getGoalNode() - Method in interface Searcher

getGoalNode - Returns a goal node if the previous search was successful, and null otherwise.

getNodeCount() - Method in interface Searcher

getNodeCount - Returns the number of nodes expanded in the previous search.

I

insert(Object) - Method in class Queue

insert - Insert the given item in the queue rear.

isEmpty() - Method in class Queue

isEmpty - Return whether or not the Queue is empty

isGoal() - Method in class LightsOutNode

isGoal() - Method in class PegSolitaireNode

isGoal - test whether or not the current node is a goal node.

isGoal() - Method in class SearchNode

isGoal - test whether or not the current node is a goal node.

L

LightsOutNode - class LightsOutNode.

class LightsOutNode - a puzzle where one seeks to get all lights out in a grid of lights.

LightsOutNode(int) - Constructor for class LightsOutNode

M

main(String[]) - Static method in class LightsOutNode

makeMove(int, int) - Method in class LightsOutNode

makeRandomMove() - Method in class LightsOutNode

makeRandomMoves(int) - Method in class LightsOutNode

P

parent - Variable in class SearchNode

variable parent - parent search node; null if and only if node is the root of the search tree.

PegSolitaireNode - class PegSolitaireNode.

PegSolitaireNode.java - Traditional 5-on-a-side Triangle Peg Solitaire; Goal: to leave one peg after removal of all others via linear jumps.

PegSolitaireNode() - Constructor for class PegSolitaireNode

Creates a PegSolitaireNode instance and sets it to an initial search state.

printSearchPath() - Method in class SearchNode

printSearchPath - Print the nodes on the path from the initial search node to this node on separate lines.

Q

Queue - class Queue.

Queue.java - a queue of Objects

Queue() - Constructor for class Queue

S

search(SearchNode) - Method in interface Searcher

search - Search for a goal node starting at the given SearchNode, and return whether or not a goal node was found.

Searcher - interface Searcher.

Searcher.java - a superclass for AI searcher classes.

SearchNode - class SearchNode.

SearchNode.java - a simple node for uninformed AI search (assuming cost equals depth).

SearchNode() - Constructor for class SearchNode

Creates an SearchNode instance and sets it to an initial search state.

T

toString() - Method in class LightsOutNode

toString() - Method in class PegSolitaireNode

toString - especially useful for debugging, tracing search execution, reporting results, etc.

toString() - Method in class Queue

toString - Return a String representation of the queue.

C D E G I L M P Q S T