I cant seem to get around the reason why A* outperforms IDA* most of the time. My proffessor has said that the reason is not because of the fact that the early(closer to root) nodes keep been reexplored as IDA* backtracks after reaching the f-limit but rather because because A* maintains an open and closed list so that a given state isnt explored multiple times through the tree whereas in IDA* if there are multiple paths to a given node in the tree, it will explore those nodes again and again. My question is it the same with IDA* ie. isnt it possible to implement IDA* with an open and closed list and if not why?
Astar vs IDAstar performance
1.1k Views Asked by Teererai Marange 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 GRAPH-ALGORITHM
- Find a MST in O(V+E) Time in a Graph
- Can Bellman-Ford algorithm be used to find shorthest path on a graph with only positive edges?
- How can i solve this the puzzle of algorithm regarding graduation
- Clustering on Graph (using Boost Graph Library)
- Algorithm to find k neighbors in a certain range?
- Graph algorithm to collect all edges which are on any path between two nodes
- Summarizing repeating gaph
- Heuristic to find the maximum weight independent set in an arbritary graph
- How to implement Transit Node Routing with Dijkstra graph search algorithm?
- Datastructure related. Find all arrays elements greater than or equal to given input
- Error in java: Exception in thread "main"
- Will multiple solutions for speeding up Dijkstra lower performance?
- When adding a random edge to a graph, which bridge edges are not bridge edges any longer?
- Shortest path in a directed graph with incorporating global path weight
- Why does the weighted quick union algorithm consider the sizes of the tree instead of their heights?
Related Questions in A-STAR
- A star algorithm not working because of pointer to parent, help fixing it
- A Star Pathfinding
- How to edit A* pathfinding algorithm to find only straight moves?
- A*, what's the best data structure for the open list?
- PHP A* Pathfinding can't work for complex maze HackerRank
- How to Represent Maze of Pixels as Nodes
- AStar sometimes no way
- A* Pathfinding in a 2D Sidescroller
- Heuristic for A*-Algorithm with irregular distances between nodes
- Implementing a wall in get successor for A*
- Comparator implementation that involves multiple objects java
- Why isn't my heuristic for the A* algorithm admissible?
- Don't understand what return does in pseudo code
- Is Manhattan distance still an admissible heuristic in this modified n-puzzle?
- When is a heuristic admissible but not consistent?
Related Questions in ITERATIVE-DEEPENING
- How does iterative deepening affect time complexity?
- How to stop alpha-beta with a timer in iterative deepening
- Implementing Minimax search with Iterative Deepening
- Minimax/ Alpha beta pruning Move Ordering?
- How to compare 3 dimensional arrays within O(0)?
- Iterative deepening or trial and error?
- Iterative deepening and move ordering
- How to I incorporate multithreading into IDA* search algorithm?
- How do I progress from Depth First Search algorithm to Iterative Deepening with Binary Tree in C#
- Iterative Deepening Depth First Search doesn't find the Goal State with 8 puzzle
- How to search a file system efficiently (algorithm-wise)?
- Infinite loop and recursion in Python
- Iterative deepening in common lisp
- Astar vs IDAstar performance
- How to make non iterative code faster than the iterative when using line by line backslash inverse?
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?
I'm not sure you completely understand IDA*. IDA* uses repeated limited depth depth-first-searches to reduce the memory requirement associated with A* (where A* normally uses more of a breadth-first-search (BFS)-like process).
If you modify IDA* to use an open and closed list, you'll probably go back to the BFS-like process, so you'll essentially be back to A*.