3. Consider the 8-puzzle problem. The start state and end stats are given in the following: (3x15=45 points) 1 4 3 5 2 6 7 8 Start state 1 2 3 4 5 6 7 8 Goal state d. Draw the BREADTH FIRST SEARCH tree e. Draw the DEPTH FIRST SEARCH tree f. Draw the DEPTH LIMITED SEARCH tree (expand to the depth 3)
Added by Samuel A.
Close
Step 1
We continue this process until we reach the goal state or exhaust all possible states. To draw the DEPTH FIRST SEARCH tree, we start with the initial state as the root node and explore as far as possible along each branch before backtracking. We continue this Show more…
Show all steps
Your feedback will help us improve your experience
Aishwarya Krishnakumar and 57 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
In Exercises $58-62$ we introduce a technique for constructing a deterministic finite-state machine equivalent to a given deterministic finite-state machine with the least number of states possible. Suppose that $M=\left(S, I, f, s_{0}, F\right)$ is a finite-state automaton and that $k$ is a non negative integer. Let $R_{k}$ be the relation on the set $S$ of states of $M$ such that $s R_{k} t$ if and only if for every input string $x$ with $l(x) \leq k$ [where $l(x)$ is the length of $x,$ as usual $], f(s, x)$ and $f(t, x)$ are both final states or both not final states. Furthermore, let $R_{*}$ be the relation on the set of states of $M$ such that $s R_{*} t$ if and only if for every input string $x,$ regardless of length, $f(s, x)$ and $f(t, x)$ are both final states or both not final states. Answer these questions about the finite-state automaton $M$ shown here. (GRAPH NOT COPY) a) Find the $k$ -equivalence classes of $M$ for $k=0,1,2,$ and $3 .$ Also, find the *-equivalence classes of $M .$ b) Construct the quotient automaton $\overline{M}$ of $M .$
Modeling Computation
Finite-State Machines with No Output
Which of the following problems is a decision problem? a) What is the smallest prime greater than n? b) Is a graph G bipartite? c) Given a set of strings, is there a finite-state automaton that recognizes this set of strings? d) Given a checkerboard and a particular type of polyomino (see Section 1.8), can this checkerboard be tiled using polyominoes of this type?
Turing Machines
Use Exercise 39 and finite-state automata constructed in Example 6 to find deterministic finite-state automata that recognize each of these sets. a) the set of bit strings that do not begin with two 0 $\mathrm{s}$ b) the set of bit strings that do not end with two 0 $\mathrm{s}$ c) the set of bit strings that contain at most one 0 (that is, that do not contain at least two 0 $\mathrm{s}$ )
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD