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
115 Views Asked by KavG At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- prolog traverse nonstandard tree left to right
- Constraint not propagated upon instantiation of list members
- SWI Prolog pass a goal with non-zero arity through the command line arguments
- Predicate that pick elements which are on list twice not less not more
- prolog-false is returned instead of a number
- Freezing goal in prolog
- freeze for more than one variable
- Why I can't get an answer for the Ship Puzzle with Prolog?
- Evaluate a number in (a few) natural language
- Prolog binding arguments
Related Questions in SEARCH
- prolog traverse nonstandard tree left to right
- Constraint not propagated upon instantiation of list members
- SWI Prolog pass a goal with non-zero arity through the command line arguments
- Predicate that pick elements which are on list twice not less not more
- prolog-false is returned instead of a number
- Freezing goal in prolog
- freeze for more than one variable
- Why I can't get an answer for the Ship Puzzle with Prolog?
- Evaluate a number in (a few) natural language
- Prolog binding arguments
Related Questions in PUZZLE
- prolog traverse nonstandard tree left to right
- Constraint not propagated upon instantiation of list members
- SWI Prolog pass a goal with non-zero arity through the command line arguments
- Predicate that pick elements which are on list twice not less not more
- prolog-false is returned instead of a number
- Freezing goal in prolog
- freeze for more than one variable
- Why I can't get an answer for the Ship Puzzle with Prolog?
- Evaluate a number in (a few) natural language
- Prolog binding arguments
Related Questions in HEURISTICS
- prolog traverse nonstandard tree left to right
- Constraint not propagated upon instantiation of list members
- SWI Prolog pass a goal with non-zero arity through the command line arguments
- Predicate that pick elements which are on list twice not less not more
- prolog-false is returned instead of a number
- Freezing goal in prolog
- freeze for more than one variable
- Why I can't get an answer for the Ship Puzzle with Prolog?
- Evaluate a number in (a few) natural language
- Prolog binding arguments
Related Questions in MANHATTAN
- prolog traverse nonstandard tree left to right
- Constraint not propagated upon instantiation of list members
- SWI Prolog pass a goal with non-zero arity through the command line arguments
- Predicate that pick elements which are on list twice not less not more
- prolog-false is returned instead of a number
- Freezing goal in prolog
- freeze for more than one variable
- Why I can't get an answer for the Ship Puzzle with Prolog?
- Evaluate a number in (a few) natural language
- Prolog binding arguments
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 # Hahtags
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.