S. Loyd popularised the 8 puzzle game in the 1870s. It is played on a three-by-three matrix with eight pieces labelled 1 through eight and one blank space. Your objective is to organise the tiles in the correct sequence. You may move any accessible tile horizontally or vertically (but not diagonally) into the vacant rectangle. Create a programme that uses the A* algorithm to answer the riddle. Begin by prioritising the sum of the number of movements made to reach this board location plus the number of tiles in the incorrect position. (Keep in mind that the number of movements you must make from a particular board location is at least as large as the number of possible moves.)Consider replacing other functions for the number of tiles in the incorrect location, such as the total of the Manhattan distances from each tile to its right position or the sums of these distances' squares.

S. Loyd popularised the 8 puzzle game in the 1870s. It is played on a three-by-three matrix with eight pieces labelled 1 through eight and one blank space. Your objective is to organise the tiles in the correct sequence. You may move any accessible tile horizontally or vertically (but not diagonally) into the vacant rectangle. Create a programme that uses the A* algorithm to answer the riddle. Begin by prioritising the sum of the number of movements made to reach this board location plus the number of tiles in the incorrect position. (Keep in mind that the number of movements you must make from a particular board location is at least as large as the number of possible moves.)Consider replacing other functions for the number of tiles in the incorrect location, such as the total of the Manhattan distances from each tile to its right position or the sums of these distances' squares.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

10- Which of the following statements about time complexity analysis is true? a. It is impossible for a correct algorithm to have a time complexity so high that it is impractical to use, but the program may feel "sluggish". b. When there are multiple possible input values with the same size, we usually only care about the input values which would cause the algorithm to run the fastest. c. Two different algorithms that solve a particular program correctly can have different time complexities. d. We usually only care about the behaviour of the algorithm as the input size gets small.
Check these two codes and then answer these questions please: 1) Empirically, show the performance curve of the algorithm using time measurements 2) Using the basics of the theoretical analysis, write the complexity of its worst-casetime. 1. Approach: Non recursive: //include necessary header files#include <iostream>using namespace std;//main functionint main(){ int days,buy_on_this_day ,sell_on_this_day; //get number of days as input from user cout<<"Enter number of days: "; cin>>days; int stock_price[days]; for(int i=0;i<days;i++) { cout<<"Enter stock_price"; cin>>stock_price[i]; } int i=0; for(int i=0;i<days-1;i++) { //comparing current price with next day price and finding the minima while(i<days-1 && stock_price[i+1]<=stock_price[i]) i++; if(i==days-1) break; buy_on_this_day =i++; while(i<days && stock_price[i]>=…
Design a reasonably efficient algorithm for solving each of the following problems and determine its efficiency class. b. You have a file of n student records indicating each student’s number, name, home address, and date of birth. Find out the number of students from each of the 50 U.S. states.
1. Analyze the following code using step account (total number of steps). Give the detailed analysis. What is the asymptotic complexity of the above algorithm?(a) int s = 0;(b) for( int i = 1; i < n; i + +)(c) for (int j = 1; j <= i; j + +)(d) s = s + j;
Copy and paste the given program and explain the sequence of the program by labelling what each algorithm does as comments in the code. #include<stdio.h> #include<conio.h> int main() { int matrix[2][2]={ {2,3}, {5,7} }; printf("\nResultant \n"); for(int i=0;i<2;i++) { for(int j=0;j<2;j++) { printf("%d",matrix[i][j]); } printf("\n");} getch(); }
Matlab (or Python) must be used to do the computations in this project.Please refer to the Matlab instructions in your study guide or on e-fundi.• Write your final answers on the answer sheet.• Save your code in a .m file as student# ass2.m (e.g. 3632706 ass2.m).• Upload your answer sheet and .m file on yourDrop Box. Do not overwrite the existing file!QUESTION 1For the given matrices A, B, C and D below, find (if possible)scalars r and s satisfying equations(i) and (ii).(i) AB = rB (ii) CD = sD;A =6 −1 10 13 −160 8 −11 , B =13.527.013.5 , C =6.70 6.00 −7.20−2.40 −4.10 2.407.20 4.80 −7.70 ,D =3.80−3.801.90
I need help in preparing a the pseudo code and a flow chart following the process below. 1. Start/Begin 2. Access the digital music library (collection) 3. Sort the songs collection by category (example: Rock, Pop, Country, Hip hop etc.) // for the sake of this problem we are only considering the Song category Pop 4. Sort the Pop songs (an array of pop songs) 5. Eliminate the duplicate songs out of the list (eliminate duplicate element in the array) 6. Sort the new Song list (an array of pop songs) 7. Eliminate songs whose duration is not a whole number (an array of pop songs whose duration is not whole number) 8. Sort the Song list alphabetically (an array of pop songs) 9. Name the list of songs as My_playlist 10. Eliminate the songs in the list to restrict the whole duration of the playlist is not less than 60 mins and greater than 70 mins (sum the duration of the elements of the array not exceeding 60 mins and greater than 70). 11. End/Stop Question 1 Illustrate your solution to the…
Suppose that you are given the following logical statement:¬ P ∧ Q → ¬ R ∨ SBased on our discussion of order of operations, which is the correct way to interpretthis?(a) ¬(P ∧ ((Q → (¬R)) ∨ S))(b) (¬(P ∧ (Q → (¬R)))) ∨ S(c) ((¬P) ∧ (Q → (¬R))) ∨ S(d) (¬P) ∧ ((Q → (¬R)) ∨ S)(e) (¬(P ∧ Q)) → (¬(R ∨ S))(f) ((¬P) ∧ Q) → ((¬R) ∨ S)(g) ((¬P) ∧ (Q → (¬R))) ∨ S(h) ((¬P) ∧ (Q → (¬R))) ∨ S(i) (¬P) ∧ ((Q → (¬R)) ∨ S)(j) ¬((P ∧ Q) → (¬(R ∨ S)))
Consider the following procedure: procedure mystery (x, y, z); integer x, y, z;beginz = 2; y= z+x;endand consider the following code fragment: A[1] := 2;A[2] := 1;n := 1;mystery (A[1],A[n],n); What will be the final values of n, A[1] and A[2] if the parameters are passed by name?
c. How many times is the basic operation executed?d. What is the efficiency class of this algorithm?e. Suggest an improvement, or a better algorithm altogether, and indicate itsefficiency class. If you cannot do it, try to prove that, in fact, it cannot bedone.
The following Python program solves Sudoku using backtracking. The method that starts the solution is "solve_sudoku(matrix)" and receives as input an n x n matrix where the empty inputs are represented by -1 from pprint import pprint def search_next_void(puzzle): for r in range(9): for c in range(9): if puzzle[r][c] == -1: return r, c return None, None def is_valid(puzzle, guess, row, col): row_vals = puzzle[row] if guess in row_vals: return False col_vars = [puzzle[i][col] for i in range(9)] if guess in col_vars: return False row_start = (row // 3) * 3 col_start = (col // 3) * 3 for r in range(row_start, row_start + 3): for c in range(col_start, col_start + 3): if puzzle[r][c] == guess: return False return True def solve_sudoku(puzzle): row, col = search_next_void(puzzle) if row is None: return True for guess in range(1, 10): if…
The following Python program solves Sudoku using backtracking. The method that starts the solution is "solve_sudoku(matrix)" and receives as input an n x n matrix where the empty inputs are represented by -1 from pprint import pprint def search_next_void(puzzle): for r in range(9): for c in range(9): if puzzle[r][c] == -1: return r, c return None, None def is_valid(puzzle, guess, row, col): row_vals = puzzle[row] if guess in row_vals: return False col_vars = [puzzle[i][col] for i in range(9)] if guess in col_vars: return False row_start = (row // 3) * 3 col_start = (col // 3) * 3 for r in range(row_start, row_start + 3): for c in range(col_start, col_start + 3): if puzzle[r][c] == guess: return False return True def solve_sudoku(puzzle): row, col = search_next_void(puzzle) if row is None: return True for guess in range(1, 10): if…