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: Write algorithm for Recursive Backtracking Algorithms pre-cond: I is an instance of the problem.…

A: given data: pre-cond: I is an instance of the problem.post-cond: optSol is one of the optimal…

Q: Implement the following algorithm using the Backtracking approach : Knight Tour Problem Rat in Maze…

A: Python Program Knight Tour Problem: # Size of Chessboard Size = 8 # Function to check the valid…

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: Find the complexity and visualisation for find the max and min in the array. Please solve clearly.

A: First I will Explain how to find the minimum element and maximum element in the array: Implement the…

Q: Greedy Consider the generalization of the rickety bridge crossing puzzle in which we have n > 1…

A: Please refer to the following step for the complete solution to the problem above.

Q: Consider the recursive algorithm CUTROD(p,n) for the Cut-Rod problem, if we wish to use the top-down…

A: Answer the above questions are as follows:

Q: 4. 1 4 7 1 4 7 Using A search for the 8-puzzle, search (manually) for a path from to the goal node 2…

A: Introduction : The 8-puzzle is a classic puzzle game, also known as the 15-puzzle. It consists of 8…

Q: I need a Python program for constructing an undirected graph and checking for cycles, The code…

A: from collections import defaultdictclass Graph: def __init__(self,vertices): # No. of…

Q: Suppose Professor Weise described a deterministic algorithm that runs in polynomial time for a known…

A: Here Option B is Correct B. The class NP would be equal to the class P

Q: I need the algorithm, proof of correctness and runtime analysis for the problem. No code necessary…

A: Hello student Greetings Hope you are doing great. Thank you!!!

Q: define the stopping condition without having to define its return value.

A: D. define the stopping condition without having to define its return value.A recursive function is a…

Q: Assess TWO (2)ways dynamic programming may be applied to solve overlapping sub-problems when…

A: The question is on comparing two ways of dynamic programming that may be applied to solve…

Q: Problem 5 :Recursion Tree Time Complexity Find the Worst case time Complexity of the following…

A: as per company guidelines, if multiple quesions posted then only first question answer can be given.…

Q: Consider the problem of computing the sum of the first n cubes: S(n) = 13 + 23 + … + n3. Design two…

A: Given function is, S(n)= 13 + 23 + … + n3 Recursive algorithm contains a function contains calling…

Q: Computer Science Implement the following algorithm using the Backtracking approach : Knight Tour…

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: 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: Given a function, f(x), which is a strictly increasing function, define an algorithm that finds the…

A: Unbounded Binary Search Given a function ‘int f(unsigned int x)’ which takes a non-negative…

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

A: In data structures and algorithms, searching refers to the process of locating a particular piece of…

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: state by using hill climbing algorithm. (10) 3 8 1 2 3 7 1 4 5 6.

A: Hill climbing search algorithm is one of the simplest algorithms which falls under local search and…

Q: Prove this problem is NP-complete: S and t are integer numbers. Does S have a subset with a…

A: The problem of determining whether a set of integers has a subset with a specified sum is known as…

Q: Hello, Monte Carlo Metropolis Algorithm Time and Space Complexity (Algorithm Analysis).…

A: The Monte Carlo Metropolis algorithm is a Markov chain Monte Carlo (MCMC) method commonly used for…

Q: Question 24. Given an implementation of an algorithm, you want to check formally its run-time…

A: Given:

Q: Design a greedy algorithm for this problem and find how long it will take to cross the bridge by…

A: The current scenario here is to solve the bridge crossing puzzle .Here we are going to use a greedy…

Q: part bProvide real world examples that differentiate the characteristics of P, and NP…

A: The question is to solve part b of the given problem.

Q: A problem has properties if an optimum solution can be built for it by creating optimal solutions…

A: Dynamic programming is a technique worn to solve problems by breaking them into smaller sub problems…

Q: computing Fibonacci numbers

A: Fibonacci numbers algorithm with complexity

Q: Show that the following issue belongs to the NP category: We are given a set S of integers and an…

A: The problem is deciding whether a subset of a given set S of integers with component product equals…

Q: Code this In python 13. Describe and analyze an algorithm to determine the number of shortest paths…

A: ALGORITHM:d.assign (n, INF); d[s] =0; set <pair <int, int >>q q.insert ({0, s});…

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: Given a 2-dimensional arrayA[1..m, 1..n], compute the number of ways (paths) of starting at the…

A: (1). The two-dimensional array A[1..m,1..n] computes the number of ways from the top-left corner to…

Q: Find the Worst case time Complexity of the following recursive function T(n)=T(n/3)+2T(n/3)+n

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: Given the initial state and final state of 8-puzzle problem, use i) ii) iii) iv) A* algorithm Best…

A: As per the guidelines we have given answer for the first part of the given question. solved using A*…

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: (b) 1: function Func(A[],n) 2: X = 0 3: for i = 1 to √n] do m = Random(²) for j = 1 to m² do for k=1…

A: Let's examine the following algorithm's execution time step by step.The outermost loop has an…

Q: Which of the following is not true about set partition problem? a) the recursive solution has a…

A: The last statement (d) is not true because in Set partition problem has both recursive as well as…

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…

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

Write the PYTHON programming to solve with breadth-first search and build node-arcs with python code for the attached problem:
Prove this issue is NP-complete: S and t are integer integers. Does S have a subset with a t-sum? Data Structures and Algorithm issue
No plagarism please! Correct and detailed answer will be Upvoted else downvoted. Thank you!
Exercise 2. Here is a classic geometric problem, in the same application domain as the Center Selection problem: Given n points with Cartesian coordinates (₁, 3) in the plane, and positive weights w, find one(!) point (x, y) that minimizes the weighted sum of the Euclidean distances to the given points. For formal clarity: We want to minimize n Σwi i-1 n •√(x- i-1 (x − x)² + (y - y₁)². This problem is at least not very easy to solve exactly. In the following we therefore propose a rough but rather quick and simple approximation algorithm: Instead of the Euclidean distance, take the Manhattan distance and minimize 1 w₁(x − x₂|+|y-yil). 2.1. Explain how the point that minimizes the weigthed sum of Manhattan distances can be found in polynonial time. That is: Sketch an algorithm, argue why it is correct, and explain your time bound. Try to keep the time bound as low as possible. 2.2. Show that this algorithm has an approximation ratio √2. More specifi- cally: The point found by the…
Show the differences between breadth first search and best first search in 8 Puzzle game. Start and goal states are given below. Sequence of operation must be up, down, left, right for blank tile and heuristic function is number of tiles out of place. Maximum 4 levels may be searched.
What is the time complexity of the best-known algorithm for solving the Traveling Salesman Problem (TSP)? Can this problem be solved in polynomial time, or is it an example of an NP-hard problem?
An NP-complete problem is a fascinating kind of problem because till now no one has discovered the polynomial-time algorithm to solve it and also no one has proved that no polynomial-time algorithm can exist for any NP-complete problem. It is an open research problem since it was first posed in 1971 to prove P#NP. The NxN Queens problem can be summarized as follows: putting N chess queens on an N×N chessboard such that none of them is able to attack any other queen using the standard chess queen's moves (row-column- diagonal). Thus, a solution requires that no two queens share the same row, column, or diagonal. Solutions exist only for N = 1 or N 2 4. Use the given function below to test whether a queen is attacked by another or not. You are not allowed to use any other code to check if a queen is safe. Implement a backtracking solution for the algorithm in Java that finds all possible solutions for N queens and measure the execution time it takes for N=4 to 12 and compare them…
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?
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.
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
please answer with proper explanation and step by step solution.