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
Question
Chapter 3, Problem 22E
Program Plan Intro
A* search
- The A* search algorithm is a search algorithm used to search a particular node of a graph.
- A* algorithm is a variant of the best-first algorithm based on the use of heuristic methods to achieve optimality and completeness.
- The algorithm A* is an example of a best-first search algorithm.
- If a search algorithm has the property of optimality, it means that the best possible solution is guaranteed to be found. Here, the user wants the shortest path to the final state.
Recursive best search algorithm:
- The recursive best-first search algorithm or RBFS belongs to heuristic algorithms.
- The RBFS algorithm expands its frontier in best-first order.
- For determining the preference of one node over the other, the RBFS uses the problem specific information about the environment.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
A frieze pattern is a decoration made from repeated copies of a basic unit, arranged in a row. Figure 1 shows two examples from France in about 1820.
Figure 1 Example friezes
a.Provide a decomposition of the problem of drawing a frieze pattern, assuming for the moment that the basic unit is repeated just 7 times. At this stage you are not trying to produce a solution, just break the problem down into smaller parts. We are looking for a decomposition that could apply to any frieze, so you should for now ignore the details of how the basic unit will be drawn. You will need to use a loop.
(4 marks)
In the remainder of this question, you will design and implement a program to draw the particular frieze shown in Figure 2.
Figure 2 The frieze pattern for this question
In this frieze the length of each horizontal and vertical segment is 25.
b.Next refine your decomposition, adding more detail so that it becomes an algorithm. This is not yet a program, so you should write the…
Design and explain a generic m-round winner tournament, Round-Winner-Tournament(P,m), for players P, in which the participants are matched randomly in each round 0, 1,...,m 1, and the winners advance to the next round. Following round m 1, the champion is chosen at random from among the remaining participants. This tournament structure, interestingly, contains the following special cases: m = 0 is a random selection tournament, m = 1 is a random pairing tournament, and m = lg |P| is a single elimination seeding tournament.
When dealing with nominal information, classification algorithms that are based on vector spaces often perform badly. What kind of ideas do you have? How can machine learning classify nominal data?
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
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
- Answer the given question with a proper explanation and step-by-step solution. You are asked to pick up a project on building highways to connect all cities in the country. The cost of building a highway between two cites i and j is c(i, j) > 0. If you were in charge from the beginning, this would have been a minimum spanning tree problem and could be solve easily with the algorithms covered in class. Since you pick it up halfway, however, some suboptimal choices have already been made by your predecessor. In other words, highways were already built between some pairs of cities. Design an algorithm to find a cost minimizing set of highways to built subject to the choices already made. Do not copy others.arrow_forwardVector space-based classification algorithms aren't always the ideal choice since there are fewer variables to examine when the problem set simply comprises nominal features. I'm curious as to your opinions on this claim. How would you apply machine learning to the task of categorizing nominal data?arrow_forwardChoose a real-world scenario with three Venn diagrams. Explain why a Venn diagram works here. Discuss the intersection and union of sets.arrow_forward
- Consider the problem of searching for genes in DNA sequences using Boyer-Moore algorithm. A DNA sequence is represented by a text on the alphabet {A, C, G, T}, and the gene segment is the pattern. Choose the problem instance for your group. (Choose the text and the pattern for your group.) If you choose a different problem instance, your answer will not be accepted and you will get zero for your solution.Construct the bad-symbol shift (?1) table and the good-suffix shift (?2) table.arrow_forwardIn order to determine the full histogram for all matchings of a given size, we need to generate every single possible matching in a unique way. This is where the inductive description from the introduction becomes useful, as it provides a way to do so recursively: We can generate all arc diagrams with n arcs from all arc diagrams with (n - 1) arcs by adding one arc to each of them in precisely 2n 1 ways. To this end, we take an arc diagram with (n - 1) arcs, insert one new point at the left end and one more point somewhere to the right of it (2n − 1 options), and then match the newly inserted points to obtain the additional arc. The only "problem" is that we need to relabel some points in doing so. - - Inserting a point to the left implies that the indices of the other points all have to be increased by one. Moreover, if we insert another point at some position m, then all the indices with values m and larger again have to be increased by one. . = 1, 2, 3. This implies that all indices…arrow_forward1. In multidimensional data analysis, it is interesting to extract pairs of similar cell characteristics associated with substantial changes in measure in a data cube, where cells are considered similar if they are related by roll-up (ie. Ancestors), drill-down (ie. Descendants), or 1-dimensional mutation (ie, siblings) operations. Such an analysis is called cube gradient analysis. Suppose the measure of the cube is average. A user poses a set of probe cells and would like to find their corresponding sets of gradient cells, each of which satisfies a certain gradient threshold. For example, find the set of corresponding gradient cells whose average sale price is greater than 20% of that of the given probe cells. Develop an algorithm than mines the set of constrained gradient cells efficiently in a large data cube.arrow_forward
- Implement and test a genetic algorithm method to approach TSPs. Solve in Python3. Solve for number of generations, selection approach, probability of crossover, length of crossover, and mutation rate for genetic algorithm. Fix your parameters. Then for each graph/matrix you’ll compute the total cost, number of nodes, CPU and real-world runtime.arrow_forwardChoose a real-world situation with several overlapping Venn diagrams. Justify the use of a Venn diagram and explain why it makes sense here. Talk about why it matters that the sets intersect and/or union.arrow_forwardGeneralize the missing attribute problem to the case of several missing features, and to several deficient patterns. Specifically, write pseudocode for creating a binary decision tree where each d-dimensional pattern can have multiple missing features.arrow_forward
- Both iterative deepening and bidirectional search (also known as BFS) are broken down and contrasted here. Give an explanation of both the benefits and the drawbacks.arrow_forwardVector space-based classification methods may not be ideal when the problem set just has nominal features due to fewer variables. Your thoughts? Machine learning to categorize nominal data?arrow_forwardIn a 0-1 knapsack problem, how could you implement a repair mutation to transform infeasible solutions into feasible ones (Le, make the sum of costs of the selected items go below the budget)?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 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