Artificial Intelligence: A Modern Approach
3rd Edition
ISBN: 9780136042594
Author: Stuart Russell, Peter Norvig
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 3, Problem 2E
a.
Explanation of Solution
State space:
- The coordinate space is defined in such a way that the center of the maze is at (0,0), and the maze itself is a square from (-1,-1) to (1,1).
- Initial state: robot at coordinate (0,0), facing North.
- Goal test: either |x|>1 or |y|>1 where (x,y) is the current location...
b.
Explanation of Solution
Size of state space:
- The state first records the intersection at which the robot is currently located at, along with the direction its facing.
- At the end of each corridor leaving the maze, users can find an exit node.
- If assumed that some node corresponds to the center of the maze.
- Initial state: at the center of the maze and facing north...
c.
Explanation of Solution
Robot’s orientation:
- Initial state: at the center of the maze.
- Goal test: at an exit node.
- Successor function: move to next intersection North, South, East, or West.
- Cost function: total distance moved...
d.
Explanation of Solution
State abstractions:
- Ignoring the height of the robot off the ground, whether it is tilted off the vertical.
- The robot can face only four directions.
- Other parts of the world ignored: possibility of other robots in the maze, the weather in the Caribbean...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.
A queen is standing on an chessboard. The chess board's rows are numbered from to , going from bottom to top. Its columns are numbered from to , going from left to right. Each square is referenced by a tuple, , describing the row, , and column, , where the square is located.
The queen is standing at position . In a single move, she can attack any square in any of the eight directions (left, right, up, down, and the four diagonals). In the diagram below, the green circles denote all the cells the queen can attack from :
There are obstacles on the chessboard, each preventing the queen from attacking any square beyond it on that path. For example, an obstacle at location in the diagram above prevents the queen from attacking cells , , and :
Given the queen's position and the locations of all the obstacles, find and print the number of…
Draw an eight-by-eight chessboard on a sheet of paper and attempt a Knight’s Tour by hand. Put a 1 in the starting square, a 2 in the second square, a 3 in the third, and so on. Before starting the tour, estimate how far you think you’ll get, remembering that a full tour consists of 64 moves. How far did you get? Was this close to your estimate?
A robot starts on a point marked “A” on a rectangular grid of points. The starting point is always the top left point on the grid. The robot can move left, right, up or down, moving from one point to the next. By moving in steps going left, right, up or down, the robot would like to reach a point marked “B”, which is always the bottom right point in the grid.
Sometimes, points are marked as “x”, and the robot is not allowed to visit them at all. A robot is never allowed to visit a point more than once.
In how many ways can the robot move from A to B and visit all points along the way?
For example, in the following grid, represented in text as
A . .
. . B
there is only one path from A to B:
In the following grid, represented in text as
A . .
x x B
there is still only one path (we're lucky because of the two x's):
However, in the grid
A . .
. x B
there are no ways for the robot to move from A to B and visit all points that are not marked with “x”.
Write a single…
Chapter 3 Solutions
Artificial Intelligence: A Modern Approach
Ch. 3 - Explain why problem formulation must follow goal...Ch. 3 - Prob. 2ECh. 3 - Prob. 3ECh. 3 - Prob. 4ECh. 3 - Prob. 5ECh. 3 - Prob. 6ECh. 3 - Prob. 8ECh. 3 - Prob. 9ECh. 3 - Prob. 10ECh. 3 - Prob. 11E
Ch. 3 - Prob. 12ECh. 3 - Prob. 13ECh. 3 - Prob. 14ECh. 3 - Prob. 15ECh. 3 - Prob. 16ECh. 3 - Prob. 17ECh. 3 - Prob. 18ECh. 3 - Prob. 20ECh. 3 - Prob. 21ECh. 3 - Prob. 22ECh. 3 - Trace the operation of A search applied to the...Ch. 3 - Prob. 24ECh. 3 - Prob. 25ECh. 3 - Prob. 26ECh. 3 - Prob. 27ECh. 3 - Prob. 28ECh. 3 - Prob. 29ECh. 3 - Prob. 31ECh. 3 - Prob. 32E
Knowledge Booster
Similar questions
- Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. You have n particular focuses (x1,y1),… ,(xn,yn) on the plane and a non-negative integer boundary k. Each point is a tiny steel ball and k is the draw in force of a ball when it's charged. The draw in power is something very similar for all balls. In one activity, you can choose a ball I to charge it. When charged, all balls with Manhattan distance all things considered k from ball I move to the situation of ball I. Many balls may have a similar facilitate after an activity. All the more officially, for all balls j with the end goal that |xi−xj|+|yi−yj|≤k, we dole out xj:=xi and yj:=yi. An illustration of an activity. Subsequent to charging the ball in the middle, two different balls move to its position. On the right side, the red dab in the middle is the normal situation of those balls. Your errand is to observe the base number of activities to move all balls to a similar…arrow_forwardIN VISUAL BASIC, solve Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.arrow_forwardSuppose that you are given an n × n checkerboard and a checker. You must move the checker from the bottom edge of the board to the top edge of the board according to the following rule. At each step you may move the checker to one of three squares: 1. the square immediately above 2. the square that is one up and one to the left (but only if the checker if not already in the leftmost column) 3. the square that is one up and one to the right (but only if the checker is not already in the rightmost column). 1 Each time you move from square x to square y, you receive p(x, y) dollars. You are given p(x, y) for all pairs (x, y) for which a move from x to y is legal. Do not assume that p(x, y) is positive. design a recursive backtracking algorithm that determines the maximum amount of money you can recieve, when moving a checker frmo somewhere on the bottom row to somewhere on the top row. your algorithm is free to pick any squrre along the bottom row as a starting point and any square along…arrow_forward
- You are given an instance of a problem where you have an n x n grid of squares. Each square can be unpainted or can have a hole, so you cannot go on the square with a hole. The objective is to paint all the squares that do not have a hole. You start in the square (0,0) which is unpainted. The actions you can do are: (1) paint the square you are on if it is not painted; (2) move, either vertically or horizontally, to an adjacent square inside the grid that is not painted and does not have a hole. a. Describe a state-space representation for the problem, specifying the state representation, the initial state, the goal condition, and the actions. b. Is the state space finite? Is it a tree or a graph? c. Propose a heuristic for the problem. Is your heuristics admissible or not? Explain briefly your answerarrow_forwardConsider you are standing at a street corner, in a city where the streets are laid out in a very regular grid pattern. At this point you randomly choose and intersection to turn on to (left, right, forward or backward - let’s say). You walk further to another intersection and make the same random choice. Rinse, lather, repeat. When you finally stop, your winding path is some direct distance away from your starting point. This is an example of a random walk. It’s a probabilistic simulation of certain statistical systems (like photons inside a star, or Brownian motion of molecules). In n steps, how far do you expect to be from your starting point? Write a Python program to help answer this question. The requirements for this assignment are straightforward: You will need to use function(s) from the Python random module. Your main function will be used to ask for user input and loop, and perform m number of walks. You will write a function called random_walk_2d that will perform a…arrow_forwardWrite a triangle (x0, y0, x1, y1, x2, y2) function to draw the triangle with vertices (x0, y0), (x1, y1), and (x2, y2). Use your function to draw some triangles. www..arrow_forward
- A hungry mouse wants to eat all four fruits in a maze such as the one below, in as few moves as possible.. At each turn the mouse can move any number of squares in one of the directions up, down, left or right, but it is not allowed to enter (or jump over) any walls (i.e., the black squares). Thus, the mouse moves just like a rook in chess. To eat a fruit, the mouse has to stop at that square. Assume that the maze has 4 fruits, and the size of b xh squares. 1. Give a suitable representatión of the states in this searching problem. 2. How many possible actions can the mouse perform at each move? (1.e., what is the branching factor?)arrow_forwardA standard science experiment is to drop a ball and see how high it bounces. Once the “bounciness” of the ball has been determined, the ratio gives a bounciness index. For example, if a ball dropped from a height of 10 feet bounces 6 feet high, the index is 0.6, and the total distance traveled by the ball is 16 feet after one bounce. If the ball were to continue bouncing, the distance after two bounces would be 10 ft + 6 ft +6 ft + 3.6 ft = 25.6 ft. Note that the distance traveled for each successive bounce is the distance to the floor plus 0.6 of that distance as the ball comes back up. Write a program that lets the user enter the initial height from which the ball is dropped, the bounciness index, and the number of times the ball is allowed to continue bouncing. Output should be the total distance traveled by the ball. Below is an example of the program input and output: Enter the height from which the ball is dropped: 25 Enter the bounciness index of the ball: .5 Enter the number of…arrow_forwardCan you help me with this code I only need help with two of the parts. I have attached my code in the photo. question that i need help with: the Eight Puzzle consists of a 3 x 3 board of sliding tiles with a single empty space. For each configuration, the only possible moves are to swap the empty tile with one of its neighboring tiles. The goal state for the puzzle consists of tiles 1-3 in the top row, tiles 4-6 in the middle row, and tiles 7 and 8 in the bottom row, with the empty space in the lower-right corner.you will develop two solvers for a generalized version of the Eight Puzzle, in which the board can have any number of rows and columns. A natural representation for this puzzle is a two-dimensional list of integer values between 0 and r · c -1 (inclusive), where r and c are the number of rows and columns in the board, respectively. In this problem, we will adhere to the convention that the 0-tile represents the empty space.tasks: In the TilePuzzle class, write a method…arrow_forward
- Please answer this only in python Alice and Bob play a game. At first, there is only one tree with roots. The players take turns, Alice begins. At one point, Alice has to pick up any empty underground tree roots (or shrubs) and remove them. Bob, on the other hand, has to pick out any part of the empty leaves and remove them from the tree (or trees). (Please note that Bob always takes some depth from the leaves of the first tree.) It is not allowed to skip the turn. The game ends when the player is unable to take a chance. Alice's goal is to reduce the number of turns made by both players, while Bob wants the number to be greater. Considering that they both played very well, how many turns did they make last. Input 1 2 12 Output 2arrow_forwardYou are a computer research scientist at Tesla, and your task is to create a computer vision application for self-driving cars to detect object and avoid collision. You know that Graham's scan is a method of computing the convex hull of a finite set of points in the plane. You decide to apply this algorithm to achieve the goal of your task. a) Suppose Graham's scan executes n points, where n >= 3. Prove that, at the end of the program, the stack S consists of, from bottom to top, exactly the vertices of convex hull in counter-clockwise order.arrow_forwardPenalty kicks in soccer. Let's consider a situation where a football player has to faceoff the goalkeeper in a penalty kickoff. Standing infront of the goalpost, the Kicker (player 1) has several angle which he could kick the ball to the goalpost. Let's say he could kick the ball in the Left corner of the goalpost, Right corner of the goalpost or shoot straight through the Center. And, same as the player, the goalkeeper (player 2) also has three options to predict which direction the player would kick the ball and try to stop it. This game can be represented using the following 3 x 3 matrix: Left Center Right 63 37 94 95 Left 100' 100 100' 100 100' 100 100. 6 100' 100 91 9 94 Center 100' 100 100' 100 94 6 93 7 60 40 Right 100' 100 100' 100 100' 100 In the above matrix, the payoff of the kicker is the probability that he scores and the payoff of the goalkeeper is the probability that the kicker doesn't score. We know that the total probability of an event is 1, therefore, all the…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education