Upload File

basic search procedure 1. start with the start node (root of the search tree) and place in on the...

  • Home
  • Documents
  • Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the
39
Basic Search Procedure Basic Search Procedure 1. Start with the start node (root of the 1. Start with the start node (root of the search tree) and place in on the search tree) and place in on the queue queue 2. Remove the front node in the queue and 2. Remove the front node in the queue and If the node is a If the node is a goal node goal node , then we are done; , then we are done; stop. stop. Otherwise Otherwise expand expand the node the node generate its generate its children using the successor function (other children using the successor function (other states that can be reached with one move) states that can be reached with one move) 3. Place the children on the queue 3. Place the children on the queue according to the according to the search strategy search strategy 4. Go back to step 2. 4. Go back to step 2.

Upload: jemimah-cook

Post on 21-Jan-2016

215 views

Category:

Documents


0 download

Report

Tags:

TRANSCRIPT

Page 1: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Basic Search ProcedureBasic Search Procedure

1. Start with the start node (root of the search 1. Start with the start node (root of the search tree) and place in on the tree) and place in on the queuequeue

2. Remove the front node in the queue and 2. Remove the front node in the queue and If the node is a If the node is a goal nodegoal node, then we are done; stop., then we are done; stop. Otherwise Otherwise expandexpand the node the node generate its children generate its children

using the successor function (other states that can be using the successor function (other states that can be reached with one move)reached with one move)

3. Place the children on the queue according to 3. Place the children on the queue according to the the search strategysearch strategy

4. Go back to step 2.4. Go back to step 2.

Page 2: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Search StrategiesSearch Strategies

Search strategies differ based on the order Search strategies differ based on the order in which new successor nodes are added in which new successor nodes are added to the queueto the queueBreadth-first Breadth-first add nodes to the end of add nodes to the end of the queuethe queueDepth-first Depth-first add nodes to the front add nodes to the frontUniform cost Uniform cost sort the nodes on the sort the nodes on the queue based on the cost of reaching the queue based on the cost of reaching the node from start nodenode from start node

Page 3: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First Search

add nodes to the end of the queueadd nodes to the end of the queue

Page 4: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

A

Page 5: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

B I E

Page 6: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

I E C D

Page 7: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

E C D M K

Page 8: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

C D M K F H

Page 9: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

D M K F H N

Page 10: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

M K F H N

Page 11: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

K F H N O G

Page 12: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

F H N O G

Page 13: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

H N O G Q

Page 14: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

N O G Q R T

Page 15: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

O G Q R T P S

Page 16: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

G Q R T P S

Page 17: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

Q R T P S

DONE!!!

Solution: A I M G

Page 18: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Depth-First SearchDepth-First Search

add nodes to the front of the queueadd nodes to the front of the queue

Page 19: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

A

Page 20: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

B I E

Page 21: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

C D I E

Page 22: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

N D I E

Page 23: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

P S D I E

Page 24: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

S D I E

Page 25: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

D I E

Page 26: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

I E

Page 27: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

M K E

Page 28: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

O G K E

Page 29: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

G K E

Page 30: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Breadth-First SearchBreadth-First SearchA

IB E

C D M K

N

F H

O G Q R T

P S

goal

Queue:

K E

DONE!!!

Solution: A I M G

Page 31: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

Example: The 8-PuzzleExample: The 8-Puzzle

States?States? integer location of tilesinteger location of tiles

Operators? Operators? move blank left, right, up, downmove blank left, right, up, down

Goal Test?Goal Test? = goal state (given)= goal state (given)

Path Cost?Path Cost? One per moveOne per move

Page 32: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

We will assume that we can do repeated state checking(i.e., we will not generate nodes that have been previously expanded)

5 4

6 1 8

7 3 2

Example: 8-Puzzle – Depth First SearchExample: 8-Puzzle – Depth First Search

Page 33: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

5 4

6 1 8

7 3 2

5 4

6 1 8

7 3 2

5 4 8

6 1

7 3 2

Example: 8-Puzzle – Depth First SearchExample: 8-Puzzle – Depth First Search

Page 34: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

5 4

6 1 8

7 3 2

5 4

6 1 8

7 3 2

5 4 8

6 1

7 3 2

5 4

6 1 8

7 3 2

5 1 4

6 8

7 3 2

Example: 8-Puzzle – Depth First SearchExample: 8-Puzzle – Depth First Search

Page 35: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

5 4

6 1 8

7 3 2

5 4

6 1 8

7 3 2

5 4 8

6 1

7 3 2

5 4

6 1 8

7 3 2

5 1 4

6 8

7 3 2

6 5 4

1 8

7 3 2

Example: 8-Puzzle – Depth First SearchExample: 8-Puzzle – Depth First Search

Page 36: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

5 4

6 1 8

7 3 2

5 4

6 1 8

7 3 2

5 4 8

6 1

7 3 2

5 4

6 1 8

7 3 2

5 1 4

6 8

7 3 2

6 5 4

1 8

7 3 2

6 5 4

1 8

7 3 2

6 5 4

7 1 8

3 2

Example: 8-Puzzle – Depth First SearchExample: 8-Puzzle – Depth First Search

Page 37: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

5 4

6 1 8

7 3 2

5 4

6 1 8

7 3 2

5 4 8

6 1

7 3 2

5 4

6 1 8

7 3 2

5 1 4

6 8

7 3 2

6 5 4

1 8

7 3 2

5 1 4

6 8

7 3 2

5 1 4

6 8

7 3 2

5 1 4

6 3 8

7 2

6 5 4

1 8

7 3 2

6 5 4

7 1 8

3 2

Example: 8-Puzzle – Depth First SearchExample: 8-Puzzle – Depth First Search

Page 38: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

5 4

6 1 8

7 3 2

5 4

6 1 8

7 3 2

5 4 8

6 1

7 3 2

5 4

6 1 8

7 3 2

5 1 4

6 8

7 3 2

6 5 4

1 8

7 3 2

5 1 4

6 8

7 3 2

5 1 4

6 8

7 3 2

5 1 4

6 3 8

7 2

6 5 4

1 8

7 3 2

6 5 4

7 1 8

3 2

1 4

5 6 8

7 3 2

5 1 4

7 6 8

3 2

Example: 8-Puzzle – Depth First SearchExample: 8-Puzzle – Depth First Search

Page 39: Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the

5 4

6 1 8

7 3 2

5 4

6 1 8

7 3 2

5 4 8

6 1

7 3 2

5 4

6 1 8

7 3 2

5 1 4

6 8

7 3 2

5 4 8

6 1

7 3 2

5 4 8

6 1 2

7 3

6 5 4

1 8

7 3 2

5 1 4

6 8

7 3 2

5 1 4

6 8

7 3 2

5 1 4

6 3 8

7 2

5 8

6 4 1

7 3 2

5 4 8

6 3 1

7 2

5 4 8

6 1

7 3 2

5 4 8

6 1 2

7 3

6 5 4

1 8

7 3 2

6 5 4

7 1 8

3 2

1 4

5 6 8

7 3 2

5 1 4

7 6 8

3 2 . . .

Example: 8-Puzzle – Depth First SearchExample: 8-Puzzle – Depth First Search


Documentation Timer Nodes - WordPress.com€¦ · Step 3:-Configure the MQGet by giving some Queue name.In the Compute node,write the below code:-Step 4:-Specify some Queue name in

SmartR T - uliege.be · Quick root tracing overview. 9 Quick root tracing overview. 10 Tracing algorithm - 1 node creation search path node creation diameter check append node node

NUMA optimized Parallel Breadth first Search on Multicore Single node System

node - cdn.cs164.netcdn.cs164.net/2014/spring/talks/node-0/node-0.pdf · Node.js Event Loop Event Queue Event Loop Thread Pool filesystem network process other

Faulty Node Repair and Dynamically Spawned Black Hole Search

The Taming of the Queue V: In Search of Excellenceoaresource.library.carleton.ca/cprn/50244_en.pdf · The Taming of the Queue V: In Search of Excellence Introduction The Taming of

Binary Search Trees - cusack.hope.edu · Binary Search Trees A Binary Search Tree is a binary tree with the following properties: Given a node x in the tree if y is a node in the

Quiz 1 : Queue based search

Review Binary Search Trees Operations on Binary Search Tree Inserting a Node Searching a Node Deleting a Node Expression Tree Decision Tree

CS 4102: Algorithms · #=∞for each node ’ add all nodes ’∈"to the priority queue PQ, using $ #as the key pick a starting node +and set $ $=0 while PQis not empty: ’=PQ.extractMin()

Section 1.2: A Single–Server Queue - LPU GUIDE · 2017. 5. 1. · A single-server service node consists of a server plus its queue If there is only one service technician, the machine

9/12/2017cis521/Lectures/uninformed-search-6up.pdf · Uninformed Search Strategies ... State Space Search Tree ... • Implemented by different queue structures (LIFO, FIFO, priority)

STATE SPACE SEARCH CASE STUDY ON IUI · 6 breadth-first search • expand shallowest unexpanded node • frontier (or fringe): nodes in queue to be explored • frontier is a first-in-

Data Structures - Stanford Universityweb.stanford.edu/class/cs97si/03-data-structures.pdf · Outline Stack and Queue Heap and Priority Queue Union-Find Structure Binary Search Tree

Search and BSTs - cse.iitk.ac.in · • Binary search trees (BSTs) to the rescue: • Each node has two possible children (can be empty) • The left sub-tree of each node must only

Web-based bioinformatics workflows for end-to-end RNA-seq ... · queue and shuts them down when the queue empties, reducing compute costs. An Apache web server runs on the head node

A Single-Server Queue - Computer Scienceesmirni/Teaching/cs526/section1.2.pdf · service node Section 1.2: A Single-Server Queue Discrete-Event Simulation °c 2006 Pearson Ed., Inc

Section 9 Graph search algorithms. Breadth-first search Idea: Let |n| denote a distance of node n from the initial node. We visit nodes in order: All

3.3 Balanced Search Trees - time.mk · to make temporary 4-node add new key D to 3-node to make temporary 4-node A C D A D search for D ends at this 3-node E J H L M R A C P S X E

Heuristic (Informed) Search · Heuristic (Informed) Search ... 4 Best-First Search It exploits state description to estimate how “good” each search node is An evaluation function

CIRCULAR L INKED L IST Insert as a first node Insert as a last node Delete first node Delete last node Insert after a node Insert before a node Search

Finger trees: a simple general-purpose data structureross/papers/FingerTree.pdf · data structure that can serve as a sequence, priority queue, search tree, priority search queue

Branch and Bound · Branch and Bound In this method we search all state space methods before any other node can become the live node. The search for a new node can not begin until

Binary Search Treesafkjm/csce311/fall2018/handouts/...9/20/2018 1 Binary Search Trees What is a Binary Search Tree? •A binary tree where each node is an object •Each node has a

Algorithms and Data Structures · –Data structure for the fringe: stack/queue/priority queue •Start the fringe with one node (root) •Repeat until stopping criteria are met:

Introduction to HPC Using zcluster at GACRC...What is zcluster –Computing Resources Queue Queue Name Total Nodes Cores/Node Max Threads RAM(GB)/Node Processor NVIDIA GPU Regular

CS180 Recitation - web.ics.purdue.educs180/Fall2009Web/recitation_slides/... · Circular Queue • A variant of the single ended queue • The tail points to the first node, not NULL

Informed (Heuristic) Search - homes.cs.washington.edu · 2018-09-20 · 4 Best-First Search • Use an evaluation function f(n) for node n. • Always choose the node from fringe

Multi-way Search Trees - EECSweb.eecs.umich.edu/~sugih/courses/eecs281/f11/lectures/10-Mway.pdf · Multi-way Search Trees! A node on an M-way search tree ... If leaf is a 2-node,

COMP3600/6466 –Algorithms · Binary Search Tree: Successor & Predecessor •Successor of a node :is the node with the smallest key greater than :.*./–that is, the node visited

Binary Search Trees Definition Of Binary Search Tree A binary tree. Each node has a (key, value) pair. For every node x, all keys in the left subtree

02 Uninf Search · 2017. 6. 16. · Breadth-first graph search function BRE ADT H-FIRST-SEARCH( problem ) returns a solution, or failure node ← a node with STAT E = problem .INIT

CS 106X, Lecture 23 Dijkstra and A* Search - web.stanford.edu · Dequeue a node add all its unseen neighbors to the queue Let’ssayweare startingataand searchingforc. 41 BFS Details

Finding Search Heuristics Henry Kautz. if State[node] is not in closed OR g[node] < g[LookUp(State[node],closed)] then A* Graph Search for Any Admissible

Recall: breadth-first search, step by stepilab.usc.edu/classes/2005cs460/notes/session07.pdf · CS 460, Session 7 5 Breadth-first search Node queue: add successors to queue end; empty