Artificial Intelligence: A Modern Approach
3rd Edition
ISBN: 9780136042594
Author: Stuart Russell, Peter Norvig
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 4, Problem 1E
Give the name of the
- a. Local beam search with k = 1.
- b. Local beam search with one initial state and no limit on the number of states retained.
- c. Simulated annealing with T = 0 at all times (and omitting the termination test).
- d. Simulated annealing with T = ∞ at all times.
- e. Genetic algorithm with population size N = 1.
Expert Solution & Answer
Explanation of Solution
a.
The local beam search with “k=1” is hill-climbing search.
b.
- Local beam search with one initial state and no limit on the number of states retained resembles with Breadth-First search.
- In breadth first search, before adding the next layer it adds one complete layer nodes.
- Starting from one state, the algorithm would be essentially identical to breadth-first search except that each layer is generated all at once.
c.
Simulated annealing with “T=0” at all time:
- There is a fact that termination step would be triggered immediately. Ignoring this fact, the search would be identical to first choice hill climbing.
- This is because; every downward successor would be rejected with probability 1.
d.
Simulated annealing with “T = ∞” at all times is a random-walk search, it always accepts a new state.
e.
Generic algorithm with population size “N=1”:
- The two selected parents will be same individual, if the population size is “1”.
- The crossover yields an exact copy of individuals. Here, the mutation chance occurs.
- Thus, the algorithm executes a random walk in the space of individuals.
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
schedule05:06
Students have asked these similar questions
Correct answer will be upvoted else downvoted. Computer science.
stage is a succession of n integers from 1 to n, in which every one of the numbers happen precisely once. For instance, [1], [3,5,2,1,4], [1,3,2] are stages, and [2,3,2], [4,3,1], [0] are not.
Polycarp was given four integers n, l, r (1≤l≤r≤n) and s (1≤s≤n(n+1)2) and requested to find a stage p of numbers from 1 to n that fulfills the accompanying condition:
s=pl+pl+1+… +pr.
For instance, for n=5, l=3, r=5, and s=8, the accompanying stages are reasonable (not all choices are recorded):
p=[3,4,5,2,1];
p=[5,2,4,3,1];
p=[5,2,1,3,4].
However, for instance, there is no change reasonable for the condition above for n=4, l=1, r=1, and s=5.
Help Polycarp, for the given n, l, r, and s, find a stage of numbers from 1 to n that fits the condition above. In case there are a few appropriate changes, print any of them.
Input
The primary line contains a solitary integer t (1≤t≤500). Then, at that point,…
Simulated annealing is an extension of hill climbing, which uses randomness to avoid getting stuck in local maxima and plateaux.
a) As defined in your textbook, simulated annealing returns the current state when the end of the annealing schedule is reached and if the annealing schedule is slow enough. Given that we know the value (measure of goodness) of each state we visit, is there anything smarter we could do?
(b) Simulated annealing requires a very small amount of memory, just enough to store two states: the current state and the proposed next state. Suppose we had enough memory to hold two million states. Propose a modification to simulated annealing that makes productive use of the additional memory.
In particular, suggest something that will likely perform better than just running simulated annealing a million times consecutively with random restarts. [Note: There are multiple correct answers here.]
(c) Gradient ascent search is prone to local optima just like hill climbing.…
Implement an algorithmic solution, indicating which states are valid and which are not, and model the space of the following problem:
An interest group from a small town decided to sue a company for commercial abuse. For this, the people have organized themselves and decided to send 3 representatives, who will have to travel in a Van to the city where the lawsuit will be filed. The company to be sued, upon learning of these actions, has decided to send 3 lawyers to persuade the representatives, who will also travel in the same Van for that purpose.
The community must file the class action suit under these conditions:
- The three applicants must reach the destination city;
- Only two people can travel per trip in the Van (small town - city, city - small town);
- There can never be more lawyers than plaintiffs in any one place (either in the small town or city) because the lawyers can persuade the plaintiffs and as a consequence, the lawsuit would not be made;
- The Van cannot be…
Chapter 4 Solutions
Artificial Intelligence: A Modern Approach
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
List the five major hardware components of a computer system.
Starting Out With Visual Basic (7th Edition)
Which of the following variable names are written with the convention used in this book? 1. decintrestrate 2. I...
Starting Out With Visual Basic (8th Edition)
Private Sub Handles btnOutput.Click
End Sub
Introduction To Programming Using Visual Basic (11th Edition)
For Exercises 3.16-3.20, perform each of these steps: Read the problem statement. Formulate the algorithm using...
C How to Program (8th Edition)
The variable x starts with the value 0. The variable y starts with the value 5. Add 1 to x. Add 1 to y. Add x a...
Starting Out with C++: Early Objects
A class is analogous to a(n) _______. a. house b. blueprint c. drafting table d. architect
Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
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
- What is the growth rate of the following algorithm? Is the worst case different than the average case? Why? y = 1; for (i=1; i<=n; i++) { for (j=1; j<=n; j++) { x = A[i] + A[j]; x = x * y; } y = y + x; }arrow_forwardFor the following prompts provide a well written response: (a) How is the language of mathematics different from the language we use in everyday life? (b) What role do conjectures play in mathematics? (c) What role do proofs play in mathematics? 2. Let p, q, r, and s be defined as follows: p : all humans have two feet q : there exist a human with ten fingers r:∀ xintherealnumberssuchthatx2 ≥0 s:∃! xintherealnumberssuchthatxarrow_forwardYou are given two algorithms A and B where A has 3,500 instructions and runs in 3 seconds; while B has 26,400 instructions and runs in 2 seconds. If you are required to compare the 2 algorithms, what criteria should you use to determine which of them is better in solving the given problem?arrow_forward
- Find simple, closed formula of the following sequence: F1, 2F2, 3F3, 4F4, ... (The F's are Fibonacci numbers)We have the answer (given by the textbook) : x*(d/dx){x/(1-x-x2)} = (x(1+x2))/((1-x-x2)2) And I'm just having trouble figuring out how to get to that point.arrow_forwardPrecisely specify the conditions under which the following algorithm returns True, and then discuss, in detail, the running time of the algorithm. If you think it has different best- and worst-case running times then these should be considered separately, and you should explain the conditions under which best and worst-cases arise.arrow_forwardApply gaussian random walk(walking in a random direction with each step of length 1. i.e. each time at random theta it will walk cos(theta) at x, sin(theta) at y). What is the probability that the walk starting at (0,0) will end at (5,5)? How to simulate it in python?arrow_forward
- Algorithm to An iterative solution to Towers of Hanoi.in: triplet S = s0, s1, s2 representing the current game stateout: triplet R = r0, r1, r2 representing the new game statelocal: pole indices a, b, z ∈ {0, 1, 2}; disc numbers g, h ∈ [2, n]; last(Q) = Q|Q|−1, if1 ≤ |Q|, otherwise, last(Q) = +∞arrow_forwardPerform a descriptive algorithm for the process of buying clothes in a warehouse where there is a variety for women, men and children, describe the income, the request for a garment, the proof and the payment of the samearrow_forwardConsider the following Dekkre’s algorithm, and write what goes wrong in this version.arrow_forward
- Provide an in-depth description of how the A* algorithm works.arrow_forwardInformation is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible. Output Format For each query, output one line containing the length of the last movie Richie watches, without the credits, given the strategy described in the problem statement. If Richie can't watch any movie, output -1. Sample Input 0 8 148 116 157 100 169 15 188 98 91 68 165 70 145 2 11 6 3 2 6 52 12 2 6 13 7 0 4 2 3 Sample Output 0 90 154 -1 The actual code n = int(input())movies = []for i in range(n): r,c = list(map(int,input().rstrip().split(" "))) movies.append([r,c]) q = int(input())for cc in range(q): s,e,a,k = list(map(int,input().rstrip().split(" "))) # solve for answer herearrow_forwardThe doubling test will result in the hypothesis that the running time is a N for a constant a when an algorithm's order of development is N log N. Is that an issue, then?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
Introduction to Big O Notation and Time Complexity (Data Structures & Algorithms #7); Author: CS Dojo;https://www.youtube.com/watch?v=D6xkbGLQesk;License: Standard YouTube License, CC-BY