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 answers
Related Questions in ALGORITHM
- MCNP 6 - Doubts about cells
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What is the algorithm behind math.gcd and why it is faster Euclidean algorithm?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- Dots and Boxes with apha-beta pruning
- What is the average and worst-case time complexity of my string searching algorithm?
- Building a School Schedule Generator
- TC problem 5-2:how to calculate the probability of the indicator random variable?
- LCA of a binary tree implemented in Python
- Identify the checksum algorithm
- Algorithm for finding a subset of nodes in a weighted connected graph such that the distance between any pair nodes are under a postive number?
- Creating an efficent and time-saving algorithm to find difference between greater than and lesser than combination
- Algorithm to find neighbours of point by distance with no repeats
- Asking code suggestions about data structure and algorithm
- Heap sort with multithreading
Related Questions in SEARCH
- How to create a regular expression to partition a string that terminates in either ": 45" or ",", without the ": "
- Hospital route finding ai project
- tryin to write a function that searches for SSN in a dict, and if that SSN is found, to retrieve all the data associated with that SSN
- How the search filter from search bar works in mern?
- Angular application loading weirdly when I add "/" at the end of URL
- Elastic python to extract last 1hr tracing
- How to detect if two sentences are simmilar, not in meaning, but in syllables/words?
- I need to have a look at all my private pine scripts and filter the scripts for certain words in TRADINGVIEW
- What is correct URL? {'quandl_error': {'code': 'QECx01', 'could not recognize URL: /api/v3/databases/WIKI/search. Please check URL and try again.'}
- Solr 9 punctuation issue
- Autocomplete search filter not working for dynamically added input fields in angular
- How to correct call API search request with debounce?
- Search in GDrive only the first 5 topics
- How do I use sp/pnp sp.search to find all Associated sites when querying a hub site Id
- How to apply custom analyzers on a field in Vespa schema
Related Questions in PUZZLE
- algorithm for making sure everyone is in the same group
- Slitherlink Puzzle
- generating solvable puzzles for a Double-Choco puzzle game. efficient data structure and algorithm to be used in?
- Finding the number of moves of 8-puzzle
- How to find the output when using an extremely large input in this algorithm?
- Jigsaw Puzzle mechanism
- How to get customized bytes from /dev/urandom?
- Hidden message in a picture
- My sudoku solver solves the puzzles but contains some zeros
- How can I cut an image into several pieces ? (REACT NATIVE)
- Generate a randomized hitori board that can be solved with python
- Making Algorithm to Find Most Move Efficient Solution in a Complicated 2d Puzzle Game
- Flutter Crop Image in jigsaw puzzle shape and use GridView.builder to build the layout
- swap places in a circle game
- Difference between no. of moves with different heuristics solving N puzzle
Related Questions in HEURISTICS
- Optimising my C loop for a combinatorial problem
- How can the Minimax (or Negamax) algorithm be implemented in a game like Scotland Yard?
- How to specify a dummy model/heuristic rule as a model in tidymodels?
- How to improve Pong AI with limited game state checks?
- Color Maze AI with A* Search- Heuristic function
- Constraint Satisfaction Problem - Least constraining value question
- How to enable heuristics in Myers linear space Diff algorithm?
- Longest Palindromic Substring - Optimization
- How to tell if a bunch of shapes are all mirror images using OpenCV?
- I need help implementing Negascout (principal variation search) for Othello
- Looking for ways of clustering data acording to distance
- Choosing proper heuristic for A* algorithm in subway network
- OptaPlanner - How to configure a selectionFilter in construction heuristics phase?
- A* search in 8-puzzle prolog
- Intuition behind heuristic functions plus example
Related Questions in MANHATTAN
- manhattan plot for more than one trait
- How to solve 8-Puzzle Using A* (a-star) Algorithm with Manhattan Distance as heuristic
- Reflecting vectors in Manhattan Space (Unit Cube)
- Fastman R package: How can set a different cex for points to be highlighted?
- Change shape of the data point based on positive or negative value in ggplot2
- y-axis breaks with ggplot2 for a manhattan plot
- Displaying Median Rent Change YoY from 2021-2022 by Manhattan Neighborhood
- OpenCL 1D range loop without knowledge of global size
- How to allow a max Manhattan distance between all the points in a group
- Difference between no. of moves with different heuristics solving N puzzle
- Custom manhattan plot multi x-axis
- Manhattan Matrix by 2 Matrices is non symmetric but should be
- Is there any place in scikit-learn Lasso/Quantile Regression source code that L1 regularization is applied?
- Trapezoidal decomposition of polygon in C++
- Create a manhattan plot in r
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?
Popular Tags
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)
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.