I tried solving the N puzzle problem using the A* algorithm with the heuristics manhattan distance and number of misplaced tiles. Even though the heuristic no. of misplaced tiles took considerably longer time, the number of moves given by the two methods was equal. Is the number of moves always the same with the two methods or can it be different?
Difference between no. of moves with different heuristics solving N puzzle
126 Views Asked by KavG At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- Two different numbers in an array which their sum equals to a given value
- Given two arrays of positive numbers, re-arrange them to form a resulting array, resulting array contains the elements in the same given sequence
- Time complexity of the algorithm?
- Find a MST in O(V+E) Time in a Graph
- Why k and l for LSH used for approximate nearest neighbours?
- How to count the number of ways of choosing of k equal substrings from a List L(the list of All Substrings)
- Issues with reversing the linkedlist
- Finding first non-repeating number in integer array
- Finding average of an array
- How to check for duplicates with less time in a list over 9000 elements by python
- How to pick a number based on probability?
- Insertion Sort help in javascript -- Khan Academy
- Developing a Checkers (Draughts) engine, how to begin?
- Can Bellman-Ford algorithm be used to find shorthest path on a graph with only positive edges?
- What is the function for the KMP Failure Algorithm?
Related Questions in SEARCH
- SQL weight rows by formula
- If Input is focused trigger X else trigger Y
- laravel full-text search with multiple keywords together
- Login form by using a new database, made in VB
- How to search for overloaded methods in a class
- Modifying Tries code in Java
- Doing a multi-column search for an item in a listView control using c#
- T SQL wildcard searching for a zip code
- django rest framework search filter all fields
- how to filter search result with dropdown list in php
- PHP/MySQL search... show all data by default, or show matched data
- Oracle multiple REPLACE options in REGEXP_REPLACE
- Is there a way to get all complete sentences that a search engine (e.g. Google) has indexed that contain two search terms?
- How to search a unknown composite key for dictionary in O(1) in c#
- android java search listview clickedItem
Related Questions in PUZZLE
- Adding a function to shift pieces of a puzzle
- Checking function for sliding puzzle javascript
- Sliding puzzle for javascript
- Solving Sudoku Programmatically
- Add the three digit numbers in a given text of string using c
- How to make path restrictions using Prolog CLP FD?
- Optimize SAT constraints of puzzle from DNF
- Coins of different denominations are placed one after the other, pick coins to maximize the sum
- KineticJS rotation issue for puzzle pieces
- C++: Return row & column of a given number in a matrix, function
- 15 puzzle make only the numbers/boxes near the empty one moveable
- What's a more efficient implementation of this puzzle?
- Creating a puzzle
- Hashi Puzzle Representation to solve all solutions with Prolog Restrictions
- Finding the counterfeit coin from a list of 9 coins
Related Questions in HEURISTICS
- Heuristic function of A* search for sorting
- Neighborhood Structure for Graph Coloring Local Search Heuristic
- Heuristic for A*-Algorithm with irregular distances between nodes
- What are some effective techniques for learning heuristic weights?
- Why allowing diagonal movement would make the A* and Manhattan Distance inadmissible?
- Why isn't my heuristic for the A* algorithm admissible?
- How do we do Graph representation in Ruby
- When is a heuristic admissible but not consistent?
- Find "complemented" bit vectors clusters
- Artificial Intelligence/Rules to guess user taste in Apparel/Clothing
- How can we implement Artificial Intelligence in Javascript games?
- Heuristic and A* algorithm
- Should I use one class or more?
- Interesting metaheuristic algorithms, easy to lern, many usages in real-world applications
- Shortest Path Algorithm in a partial graph
Related Questions in MANHATTAN
- OpenCL 1D range loop without knowledge of global size
- Is there any place in scikit-learn Lasso/Quantile Regression source code that L1 regularization is applied?
- Manhattan Matrix by 2 Matrices is non symmetric but should be
- Manhattan plot not labelling all data points
- Custom manhattan plot multi x-axis
- How to allow a max Manhattan distance between all the points in a group
- how does a best first search decide on equal distance nodes?
- Reduce white space on Manhattanplot (Package: qqman in R) between axis label and axis
- Calculate Manhattan distance for n_puzzle problem?
- Manhattan distance with impassible tiles - python
- Create a manhattan plot in r
- Trapezoidal decomposition of polygon in C++
- Why my algorithm doesn't work for manhattan skyline from codility
- Displaying Median Rent Change YoY from 2021-2022 by Manhattan Neighborhood
- y-axis breaks with ggplot2 for a manhattan plot
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
If the heuristic is admissible (i.e. it never overestimates the number of moves still to do), then the solution found by the A* algorithm is guaranteed to be optimal.
The two heuristic functions you only briefly describe seem both to be admissible, so it is expected that in both cases you get the optimal number of moves.