Premium
Using procedural parameters and continuations in combinatorial searches
Author(s) -
Hwang WenPing,
Wang ChingLin
Publication year - 1994
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380240404
Subject(s) - backtracking , search tree , computer science , depth first search , tree (set theory) , beam stack search , algorithm , mathematics , mathematical optimization , search algorithm , combinatorics , beam search , best first search
Abstract We use procedural parameters as a means to cut off unwanted branches in a search tree. The technique may be used to effect non‐blind backtracking. A recursive algorithm for generating all strings of n pairs of balanced parentheses is chosen as an illustrative example, since it cannot be formulated by conventional recursive backtracking.