Artificial Intelligence: A Modern Approach
3rd Edition
ISBN: 9780136042594
Author: Stuart Russell, Peter Norvig
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 5, Problem 3E
a.
Explanation of Solution
Game tree
- The values are just minus the...
b.
Explanation of Solution
Strongest fact about the value
The name of the
c.
Explanation of Solution
Name of the node
- The name of the node is b...
d.
Explanation of Solution
Bound on the value
- The shortest-path length between the two players is a lower bound on the total capture
Time.
- It have a capture time greater than or equal to the sum of the cost from the root and the shortestpath length...
e.
Explanation of Solution
Nodes that do not expand
- The right child is known to ...
f.
Explanation of Solution
Winner of the game
- The pursuer always wins the game if the tree is finite.
- The tree is assumed to be roo...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
A group of people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After x number of passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins.
For example:
number of passes = 1 and number of players = 5, the order of elimination is 2, 4, 1, 5.
Write a program for general values of X and N.
Ask a user for the number of people and number of passes
To speed up the input and debugging, you may wish to store the names of the people in a file. Make sure no two names start the same letter ( Alex and Ana are not OK). Alternatively, you can number the players.
Output number and/or the name of a person being eliminated
Output number and the name of the winner
Do not expect a user to do the right thing, error check the user input; among other things, what do you think a reasonable…
业
In the 8 queens problem, you are to place 8 queens on the chessboard in such a way that no two queens attack each
other. That is, there are no two queens on the same row, column, or diagonal. The picture above shows a near
solution--the top left and bottom right queens attack each other.
We want to solve this problem using the techniques of symbolic Al.
First, we need states. What would the best choice be for states?
Each queen and its position x
Michigan, Illinois, Indiana, etc.
How many queens we have placed so far
A board with the positions of all the queens that have been placed so far
00
What would the start state be?
A single queen's position
Crouched, with fingers on the starting line
Placing the first queen x
An empty board
What would the goal state be?
CA board with 8 queens placed
Ball in the back of the net
The positions of all 8 queens
A board with 8 queens placed, none attacking each otherv
What would the best choice for "edges" or "moves" be?
Tiktok
Moving a queen from…
This problem is taken from the delightful book "Problems for Mathematicians, Young and Old" by Paul R. Halmos.
Suppose that 931 tennis players want to play an elimination tournament. That means: they pair up, at random, for each round; if the number of players before the round begins is odd, one of them, chosen at
random, sits out that round. The winners of each round, and the odd one who sat it out (if there was an odd one), play in the next round, till, finally, there is only one winner, the champion. What is the total
number of matches to be played altogether, in all the rounds of the tournament?
Your answer:
Hint: This is much simpler than you think. When you see the answer you will say "of course".
Chapter 5 Solutions
Artificial Intelligence: A Modern Approach
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- A group of people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After x number of passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. For example: number of passes = 1 and number of players = 5, the order of elimination is 2, 4, 1, 5. Write a program for general values of X and N. Ask a user for the number of people and number of passes To speed up the input and debugging, you may wish to store the names of the people in a file. Make sure no two names start the same letter ( Alex and Ana are not OK). Alternatively, you can number the players. Output number and/or the name of a person being eliminated Output number and the name of the winner Do not expect a user to do the right thing, error check the user input; among other things, what do you think a reasonable…arrow_forwardIn the game of 10-pin bowling the bowler has two attempts to knock down pins for every frame of 10-pins, and scores a point for each pin knocked down. If all the pins are knocked down with two attempts, the bowler gets a bonus - whatever score they obtain with their next bowl is doubled. If all the pins are knocked down on the 1st attempt, no 2nd attempt is allowed, and the bowler gets a bonus – whatever score they obtain on their next two bowls are doubled. A student attempts to capture this scoring system in VHDL code, a fragment of which is shown in Figure Q4. Q4 (a) Draw the state transition diagram described by the VHDL of Figure Q4. Discuss whether the VHDL of Figure Q4 correctly scores a game of 10-pin bowling. (b) elsif CLK='1' and CLK'event and UPD='1' then case present state is when throwl => frame := frame + 1; + resize (unsigned (N), 9) score := score if N = w1010" then present state score := score + resize (unsigned (N), 9) present state + resize (unsigned (N),9) if N =…arrow_forwardGiven a deck of 52 playing cards, we place all cards in random order face up next to each other. Then we put a chip on each card that has at least one neighbour with the same face value (e.g., on that has another queen next to it), we put a chip. Finally, we collect all chips that were each queen placed on the cards. For example, for the sequence of cards A♡, 54, A4, 10O, 10♡, 104, 94, 30, 3♡, Q4, 34 we receive 5 chips: One chip gets placed on each of the cards 100, 10♡, 104, 30, 3♡. (a) Let p5 be the probability that we receive a chip for the 5th card (i.e., the face value of the 5th card matches the face value of one of its two neighbours). Determine p5 (rounded to 2 decimal places). (b) Determine the expected number of chips we receive in total (rounded to 2 decimal places). (c) For the purpose of this question, you can assume that the expectation of part (b) is 6 or smaller. Assume that each chip is worth v dollars. Further, assume that as a result of this game we receive at least…arrow_forward
- Consider the following scenario:A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, the principal plays the following game: She asks the first student to open all the lockers. She then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, thestudent opens it. The fourth student is asked to check every fourth locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game. In general, the nth student checks every nth locker. If it is open, the student closes it; if it is closed, the student opens it. After all the students have taken turns, some of the lockers are open and some are closed. The program see in the photo, when ran, should ask the user to enter the number of lockers in the school. The program will output the number of lockers and the…arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. every cell of the network contains a non-negative integer. Each turn, a player should play out every one of the accompanying activities all together. Pick a beginning cell (r1,c1) with non-zero worth. Pick a completing cell (r2,c2) to such an extent that r1≤r2 and c1≤c2. Lessening the worth of the beginning cell by some sure non-zero integer. Pick any of the most limited ways between the two cells and either increment, lessening or leave the upsides of cells on this way unaltered. Note that: a most limited way is one that goes through the most un-number of cells; all cells on this way barring the beginning cell, yet the completing cell might be altered; the subsequent worth of every cell should be a non-negative integer; the cells are changed freely and not really by a similar worth. On the off chance that the beginning and finishing cells are something very…arrow_forwardConsider the following scenario: A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, the principal plays the following game: She asks the first student to open all the lockers. She then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, the student opens it. The fourth student is asked to check every fourth locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game. In general, the nth student checks every nth locker. If it is open, the student closes it; if it is closed, the student opens it. After all the students have taken turns, some of the lockers are open and some are closed. The program below, when ran, will prompt the user to enter the number of lockers in the school. After the game is over, the program will output the number of…arrow_forward
- Correct answer will be upvoted else downvoted. Computer science. All arbitrary choices that are made during the title are made similarly plausible and autonomously. For instance, assuming n=4, a=[1,2,4,3], one of the choices for the game (there could be different choices) is: during the main game, the first and fourth players were chosen. The fourth player has more tokens, so he takes the main player's tokens. Presently a=[0,2,4,4]; during the subsequent game, the fourth and third players were chosen. They have similar number of tokens, yet arbitrarily, the third player is the champ. Presently a=[0,2,8,0]; during the third game, the second and third players were chosen. The third player has more tokens, so he requires the second player's tokens. Presently a=[0,0,10,0]; the third player is proclaimed the victor of the title. Title champs will get customized prizes. Consequently, the adjudicators need to know ahead of time which players get an opportunity of winning,…arrow_forwardDingyu is playing a game defined on an n X n board. Each cell (i, j) of the board (1 2, he may only go to (2, n).) The reward he earns for a move from cell C to cell D is |value of cell C – value of cell D|. The game ends when he reaches (n, n). The total reward - is the sum of the rewards for each move he makes. For example, if n = 1 2 and A = 3 the answer is 4 since he can visit (1, 1) → (1, 2) → (2, 2), and no other solution will get a higher reward. A. Write a recurrence relation to express the maximum possible reward Dingyu can achieve in traveling from cell (1, 1) to cell (n, n). Be sure to include any necessary base cases. B. State the asymptotic (big-O) running time, as a function of n, of a bottom-up dynamic programming algorithm based on your answer from the previous part. Briefly justify your answer. (You do not need to write down the algorithm itself.)arrow_forwardCorrect answer will be upvoted else downvoted. Computer science. first move is made by Alice, the second — by Bob, the third — by Alice, etc. During their turn, the player should pick one of the chips from the board and move it any sure number of cells to one side (along these lines, if the chip was in segment I, it can move to any segment j<i, and the chips in the furthest left segment can't be picked). Alice and Bob have q sets of numbers Li and Ri. For each such pair, they need to figure out who will be the victor of the game if l=Li and r=Ri. Note that these games ought to be thought about freely (they don't influence the condition of the board for the following games), and both Alice and Bob play ideally. Input The main line contains two integers n and m (1≤n,m≤2⋅105) — the number of lines and segments on the board, separately. The subsequent line contains n integers c1,c2,… ,cn (1≤ci≤m), where ci is the file of the segment where the chip in the I-th line is…arrow_forward
- The rook is a chess piece that may move any number of spaces either horizontally or vertically. Consider the “rooks problem” where we try to place 8 rooks on an 8x8 chess board in such a way that no pair attacks each other. a. How many different solutions are there to this?b. Suppose we place the rooks on the board one by one, and we care about the order in which we put them on the board. We still cannot place them in ways that attack each other. How many different full sequences of placing the rooks (ending in one of the solutions from a) are there?arrow_forwardThe diagram below shows the arrangement of a Habitrail cage for a pet hamster. (Plastic tubes connect different cages.) Is it possible for a hamster to travel through every tube without going through the same tube twice? If so, find a route for the hamster to follow. Can the hamster return to its starting point without repeating any tube passages>arrow_forwardJosefine and her friends has invented a new game called Pillar Jumpers. In this game, a sequence of N pillars of non decreasing heights are placed next to each other. The player starts on the first pillar, and the target is to reach the la pillar in at most J jumps. The player has a certain jump strength S that determines how far he can jump. Let h; be t height of the i'th pillar for i e [1...N). The player can jump from pillar i to j iff. iarrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable 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