References in periodicals archive ?
For example, a backtracking search technique [4, 5] is a search based algorithm which systematically generates all possible solutions for the given NA-N board.
We can express the backtracking search as a recursive procedure ExtendRight: ExtendRight (PartialWord, node N in dawg, square) = if square is vacant then If N is a terminal node then LegalMove (PartialWord) for each edge E out of N if the letter l labeling edge E is in our rack and l is in the cross-check set of square then remove a tile l from the rack let N' be the node reached by following edge E let next-square be the square to the right of square ExtendRight (PartialWord .
For contributions to temporal reasoning, backtracking search algorithms, and constraint programming.