Download presentation

Presentation is loading. Please wait.

Published byAshlynn Golden Modified about 1 year ago

1
1 Tree Searching Strategies Updated: 2010/12/27

2
2 The procedure of solving many problems may be represented by trees. Therefore the solving of these problems becomes a tree searching problem.

3
3 Satisfiability problem Tree Representation of Eight Assignments. If there are n variables x 1, x 2, …,x n, then there are 2 n possible assignments.

4
4 Satisfiability problem An instance: -x 1 …….. …… (1) x 1 …………..(2) x 2 v x 5 …. ….(3) x 3 ……. …….(4) -x 2 ……. …….(5) A Partial Tree to Determine the Satisfiability Problem. We may not need to examine all possible assignments.

5
5 Hamiltonian circuit problem E.g. the Hamiltonian circuit problem A Graph Containing a Hamiltonian Circuit

6
6 Fig. 6-8 The Tree Representation of Whether There Exists a Hamiltonian Circuit of the Graph in Fig. 6-6

7
7 A tree showing the non-existence of any Hamiltonian circuit.

8
8 8-Puzzle Problem Initial State: Goal State:

9
9 Tree Representation of the solution of 8-puzzle problem

10
10 How to expand the tree ? Breadth-First Search Depth-First Search Hill Climbing Best-First Search

11
11 Breadth-First Search Scheme In breadth-first search, all the nodes on one level of the tree are examined before the nodes on the next level are examined. It can be accomplished with the help of the queue.

12
12 Breadth-First Search Scheme Step1 Step1: Form a one-element queue consisting of the root node. Step2 Step2: Test to see if the first element in the queue is a goal node. If it is, stop. Step3 Step3: Remove the first element from the queue. Add all descendants of the first element, if any, to the end of the queue one by one. Step4 Step4: If the queue is empty, then signal failure. Otherwise, go to Step 2.

13
Goal Node

14
14 Depth-First Search Scheme The depth-first search always selects the deepest node for expansion. It can be accomplished with the help of the stack.

15
15 Depth-First Search Scheme Step1 Step1: Form a one-element stack consisting of the root node. Step2 Step2: Test to see if the top element in the stack is a goal node. If it is, stop. Step3 Step3: Remove the top element from the stack. Add all descendants of the first element, if any, to the top of the stack one by one. Step4 Step4: If the stack is empty, then signal failure. Otherwise, go to Step 2.

16
16 E.G.: the depth-first search E.g. sum of subset problem Given a set S={7, 5, 1, 2, 10}, answer if S ’ S sum of S ’ = 9. The Sum of Subset Problem Solved by Depth-First Search.

17
17 Hill climbing A variant of depth-first search The method selects the locally optimal node to expand. E.g. for the 8-puzzle problem, evaluation function f(n) = w(n), where w(n) is the number of misplaced tiles in node n.

18
18 Hill Climbing Search Scheme Step1 Step1: Form a one-element stack consisting of the root node. Step2 Step2: Test to see if the top element in the stack is a goal node. If it is, stop. Step3 Step3: Remove the top element from the stack. Add the first element ’ s descendants, if any, to the top of the stack according to order computed by the evaluation function. Step4 Step4: If the stack is empty, then signal failure. Otherwise, go to Step 2.

19
19 An 8-Puzzle Problem Solved by the Hill Climbing Method

20
20 Best-first search strategy Combing depth-first search and breadth-first search Selecting the node with the best estimated cost among all nodes. This method has a global view.

21
21 Best-First Search Scheme Step1 Step1:Consturct a heap by using the evaluation function. First, form a 1-element heap consisting of the root node. Step2 Step2:Test to see if the root element in the heap is a goal node. If it is, stop. Step3 Step3:Remove the root element from the heap and expand the element, i.e., add all descendants of the element into the heap. Step4 Step4:If the heap is empty, then signal failure. Otherwise, go to Step 2.

22
22 An 8-Puzzle Problem Solved by the Best-First Search Scheme Goal Node

23
Q&A 23

Similar presentations

© 2016 SlidePlayer.com Inc.

All rights reserved.

Ads by Google