Ensuring a Relevant Visiting Order of the Leaf Nodes During a Tree Search.pdfVIP

Ensuring a Relevant Visiting Order of the Leaf No des during a Tree Search Nicolas Prcovic and Bertrand Neveu CERMICS BP SophiaAntip olis France email BertrandNeveusophiainriafr Abstract We dene a mo del for heuristic tree search which assumes that the quality of the heuristic used for ordering the successors of a no de improves as depth increases We show that a usual value ordering heuristic for solving constraint satisfaction problems ts to this mo del Our mo del denes a partial order on the leaf no des of the search tree according to their probability to b e a solution We check which search strategies among interleaved depthrst search IDFS limited discrep ancy search LDS and depthb ounded discrepancy search DDS visit the leaf no des while resp ecting the partial order Our study leads to con clude that among these strategies only Pure IDFS and a slight mo di cation of improved LDS resp ect it Intro duction Some new kinds of depthrst searches have recently app eared Limited discrep ancy search LDS HG Interleaved depthrst search IDFS Mes and Depthb ounded discrepancy search DDS Wal They intend to b e ecient alternatives to the traditional depthrst search DFS for which making an early mistake can b e very costly to undo These metho ds expand the search tree by trying to rst reach the leaf no des the most likely to b e solutions thanks to the knowledge of their discrepancies ie the branching p oints where the heuristic decision is not resp ected This improvement in the order for visiting the leaf no des has a cost inter