2) Describe in detail one heuristic for the 8-puzzle that over-estimates the solution cost.Show in detail how it can lead to a suboptimal solution on some particular problemwhen using Algorithm A.3) When performing an algorithm A search, does monotonicity in f values implyadmissibility of the associated h heuristic function? Recall that algorithm Á is notA*, and does not have any restrictions on h other than that it be >0. State allassumptions, and prove or disprove your claim.

Given: 8 Puzzle problem A Algorithm

Answered: 2) Describe in detail one heuristic for…

2) Describe in detail one heuristic for the 8-puzzle that over-estimates the solution cost. Show in detail how it can lead to a suboptimal solution on some particular problem when using Algorithm A.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: 1. (p. 553) Consider the optimization problem minimize x +2x subject to x, +x, = 3 Write MATLAB code…

A: Please find the answer below:

Q: 6.2. Use the algorithm described in Proposition 6.5 to solve each of the following subset-sum…

A: The subset-sum problem is a computational problem in computer science and mathematics. It involves…

Q: Q2: Assume we have a robot in the Vacuum-world Problem which described in our lectures. If we extend…

A: Answer: I have given answered in the handwritten format in brief explanation

Q: Computer Science p=317, q=811 (a) Consider the multiplicative group F∗p and find a generator…

A: Here is the explanation:

Q: This question concerns computational complexity. In this question, the perfect square problem is the…

A: In this question we have to adapte Heron's algorithm (a square root approximation method) into a…

Q: Classical elimination theory Labati's algorithm 1. Implement Labati's triangulation of systems of…

A: Answer: I have given answered in the handwritten format in brief explanation

Q: Answer the given question with a proper explanation and step-by-step solution. You are asked to…

A: This problem can be solved using a modification of the Kruskal's algorithm for finding the minimum…

Q: The graphic in the picture representing the road planning to be made has been prepared. paths…

A: a) To calculate the shortest path from the starting point to all other vertices, one common…

Q: stablish that this problem is NP-complete. Both S and t are whole numbers. Can we t-sum a subset…

A: The Subset Sum problem is the name for the issue you've just explained. Determine whether there is a…

Q: Design a dynamic programming algorithm for the bigger-is-smarter elephant problem by comparing it…

A: dynamic programming approach to solve the Bigger-is-Smarter Elephant Problem.

Q: Write a short essay (1 short paragraph for each) to answer the questions in the space provided…

A: Since you are asking multiple questions, we are doing first 3 questions for you. a. Backtracking…

Q: 6 (2b) Show work pages that follow, properly numberd, and record only the answers on this page.…

Q: P and NP problem are identified and explain the way

A: A.P and NP problem are identified and explain the way used to solve them. B.along with space and…

Q: For a problem we have come up with three algorithms: A, B, and C. Running time of Algorithm A is…

A: Answer in step 2

Q: (a) Give an algorithm for computing the intersection of a 3D triangle abc with a sphere with center…

A: (a) Give an algorithm for computing the intersection of a 3D triangle abc with a sphere with center…

Q: Based on the definition given in Chapter 14 about tractable and intractable problems in computer…

A: Answer : Tractable problem : This is a problem in computer science programming which is solved by…

Q: a) For the following functions below state the relationship between the hyperbolic and its…

A: ANSWER: Hyperbolic Function: Any of a bunch of six functions comparable to the mathematical…

Q: [a] Identify three ways to solve the problem of finding the shortest distance between all pairs of…

A: a) Identify three ways to solve the problem of finding the shortest distance between all pairs of…

Q: I need a flow graph that contains a start node and a terminal node. and continue solving b and c I…

A: Approach to solving the question: Pseudocode for Sieve of EratosthenesEratosthenes(n) { e[1] :=…

Q: Explain what it means for an algorithm to exhibit optimal substructure and contain overlapping…

A: There are certain structures that help for dynamic programming, they are optimal substructure and…

Q: Determine the best case running time of the algorithm and state what condition must be true for it…

A: Pseudocode AnalysisLet's analyze the steps that are clear in the pseudocode:Initializing variables:…

Q: a) Apply Dijkstra's algorithm to the graph below to compute all the shortest paths from node "J".…

Q: Find Fibonacci series using recursion?

A: ## As no language is mentioned, the code is written in Python. def fib(n):…

Q: The questions in this section refer to this edge-weighted graph: A 7 4 7 12 E

A: Dijkstra's algorithm is a powerful and widely-used algorithm for finding the shortest paths between…

Q: Problem 1. A walk in a directed graph G = (V, E) from a vertex s to a vertex t, is a sequence of…

A: An algorithm is a set of precise and well-defined instructions that are used to solve a problem or…

Q: A common geometric problem is, given a set of N lines, how many intersect. The brute force algorithm…

A: A common geometric problem is, given a set of N lines, how many intersect. The brute force algorithm…

Q: Implement this solution in Java

A: The code implements Dijkstra's algorithm for finding the shortest path in a weighted graph. Here is…

Q: (1) Describe the Bellman-Ford algorithm for solving the shortest path problem. (2) State the time…

A: This algorithm can be used to find the shortest path to all vertices starting from source vertex.…

Q: [a] Prove that the "Bin Packing Problem" (BPP) is NP-Complete. Like the rest of the exam, you may…

A: According to the Bartelby guidelines we are suppose to answer one question at a time. Kindly repost…

Q: Select the complexity class (P. NP- complete, undecidable) for each of the following problems: Find…

A: The complexity class of the problem

Q: As we know, the heuristic or approximation algorithms may not give an optimum solution to the…

A: The travelling salesman problem (TSP) is an NP complete problem which also comes under NP hard.…

Q: A two dimensional array of red and green entries represents a maze. Green entries are passable and…

A: Given information: A two dimensional array of red and green entries represents a maze. Green entries…

Q: find the local minimum for that graph.

A: Functions can have "hills and valleys": places where they reach a minimum or maximum value. It may…

Q: (c) Draw the recursion tree for the recurrence T(n) = 3T (|n//3|) + cn, where c is a constant, and…

A: Recursion tree is the method for solving the recurrence relations.Recursion tree may be a tree…

Q: Solve the following exercise using jupyter notebook for Python, to find the objective function,…

A: The objective of the question is to determine the optimal mix of corn and soybeans to minimize the…

Q: (a)Find an appropriate algorithm for the given problem. (b)Draw the graph. (c)Find the maximum…

A: An entity: Spark. js is a framework for effortlessly creating simple and fast internet approaches…

Q: Please code an enumerative algorithm using Java in order to solve the Traveling Salesperson Problem.…

A: Answer : TRAVELLING SALESMAN PROBLEM USING JAVA import Java.util.*; import java.io.*; import…

Q: 4. The following algorithm for approximating roots combines the bisection method with Newton's…

A: Python Code

Q: Write the PYTHON programming to solve with breadth-first search and build node-arcs with python code…

A: Summary:In this question, we need to write python code to solve the given problem.

Question

2) Describe in detail one heuristic for the 8-puzzle that over-estimates the solution cost.
Show in detail how it can lead to a suboptimal solution on some particular problem
when using Algorithm A.
3) When performing an algorithm A search, does monotonicity in f values imply
admissibility of the associated h heuristic function? Recall that algorithm Á is not
A*, and does not have any restrictions on h other than that it be >0. State all
assumptions, and prove or disprove your claim.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

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

Using Java, create and implement an iterative improvement algorithm that will find the approximation of a vertex in a parabola. The x-coordinate needs to be within 0.01 of the actual value. The algorithm must work for any quadratic function.Sample Run:Enter the coefficients for the parabola ax^2+bx+c: 2, 3, 1The vertex for the parabola is approximately:(-0.75, -0.125)
There are many applications of Shortest Path Algorithm. Consider the problem of solving a jumbled Rubik's Cube in the fewest number of moves. I claim that this problem can be solved using a Shortest Path Algorithm. Determine whether this statement is TRUE or FALSE. NOTE: if you want to check if this statement is TRUE, think about how the Rubik's Cube Problem can be represented as a graph. What are the vertices? Which pairs of vertices are connected with edges? What is your source vertex and what is your destination vertex? How would Dijkstra's Algorithm enable you to find the optimal sequence of moves to solve a jumbled cube in the fewest number of moves?
Submit solutions to the following problems in a single pdf document preferably completed using LaTeX. It is likely that you will need to use programming (Python) or a matrix calculator to solve most of the problems. You do not need to submit the code, but you should include explanations of all your conclusions. 3. Consider the cat polygon with vertices at (0, 0), (3, 3), (3, 6), (2, 7), (1, 6), (-1, 6), (-2, 7), (-3, 6), and (-3, 3). a. Write a single matrix that will make the cat's face twice as tall, half as wide, and rotate anti- clockwise 45 degrees. What is the determinant of the transformation matrix? b. Calculate the area of the cat's face prior to transformation and after the transformation. How does the change in area relate to the determinant of the transformation matrix?
Please answer this question in 10 mins I will upvote your answer this question. Imagine a maze that consists of an n x n grid of cells. You can move from a cell to its neighbor provided there is no wall obstructing your path in that direction. Your goal is to find a path from the top right cell in the maze to the bottom left cell. a) Explain how finding a path through this maze can be represented as a graph problem. Clearly explain what the nodes and edges in your graph formulation correspond to in terms of the structure of the original maze. You may include a diagram or a sketch to explain your reasoning. b) using c++, implement an algorithm to find if a given maze has a solution (i.e., if it has a path that connects the top right cell to the bottom left cell). If it has a solution, the algorithm should return this path. If there is more than one possible solution, your algorithm should return any one of those possible paths. If there is no solution to the maze, return a special…
A recursive algorithm is applied to some data A = (a₁,..., am) where m≥ 2. The running time T is characterised using the following recurrence equations: T(2) = c when the size of A is 2 T(m) = T(m-1) + 2c otherwise Determine the running time complexity of this algorithm.
11. ) An algorithm X has two parts XA and Xg. In order to complete running algorithm X both parts have to be executed consecutively. If running time of XA is e(f(n)), and running time of Xp is O() then what should be f(n) so that algorithm X has the most efficient solution.
(e) Give a simple recursive definition for the function sos(A), which gives the length of the shortest oscillating supersequence of an arbitrary array A of integers.
3. Floyd's algorithm for the shortest Paths (algorithm 3.3) can be used to construct the matrix D, which contains the lengths of the shortest paths from any point to any other point. Given the following graph, construct the adjacency matrix W and use the recursive relation to construct D¹. Note that the entire process starting with W is W (= Dº) -> D¹ -> D² -> D³ ->.........-> D^ (= D). You only need to show the step from W to D¹. To get extra credit show the remaining steps to obtain D5 (=D). V5 3 3 5 V1 1 V4 2 9 1 4 2 V2 V3 3