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
- 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 GRAPH-ALGORITHM
- Finding optimal swapping paths in employees moving to different cities
- How create an adjacency matrix of a Maze graph
- Convert python functions (shortestpath/ prediction function using nx.adamic_adar_index) into API
- How is a cut lonely if there are often multiple edges crossing a cut in a connected undirected graph?
- How to group nodes in a directed graph so that no two nodes in a group have paths between them?
- Is this total sink algorithm only for dags?
- What would be the best way to solve this maximum path graph problem, is Dijkstra possible even?
- Given undirected graph when removing edges one-by-one verify if removed one was a bridge and if so - the vertices of both parts
- Select n items from a set of subsets
- Implementing Kosaraju's Algorithm for SCC's
- modify current algorithm - APSP
- Does the removal of a few edges remove all paths to a node?
- Sliding Puzzle - DFS Issue
- Can we transform a graph in a way that applying DFS to the new graph would result in the same traversal order as applying BFS on the first graph?
- Advantages of linked lists in adjacency representation of a graph
Related Questions in A-STAR
- Hospital route finding ai project
- Struggling with A* Pathfinding in C#
- Simplify 2D map to optimize pathfinding
- Applying Dijkstra Algorithm To Find Lowest Energy Path
- Implementing A star algorithm to sliding tile puzzle game using C# forms
- How does this specific version of A-star algorithm work?
- I'm having troubles with the A* Algorithim implementation in Java, why is it being infinite?
- How to solve 8-Puzzle Using A* (a-star) Algorithm with Manhattan Distance as heuristic
- A star Pathfinding algorithm with Lego Mindstorms ev3
- Having trouble with delaunay, minimum spanning tree and astar for level generation
- Why does this implementation of the A* algorithm use only one queue?
- Fill a list to use the A* (a-star) algorithm with python
- I'm trying to solve, Advent of Code Day 17 Part 2. I get the correct answer to Part 1 but when i modified to solve P2 I get the wrong answer for input
- Why my A* algorithm isn't working when I specify a node weight?
- Choosing proper heuristic for A* algorithm in subway network
Related Questions in ITERATIVE-DEEPENING
- How to compare 3 dimensional arrays within O(0)?
- Iterative deepening with time limit, minimax algorithm with alpha beta pruning and heuristics
- Understanding space complexity within IDDFS (Iterative Deepening Depth First Search)
- How to make non iterative code faster than the iterative when using line by line backslash inverse?
- Iterative deepening and move ordering
- Optimizing iterative deepening depth first search in C++
- Using Iterative deepening DFS for knapsack similar problem
- Iterative Deepening Depth First Search doesn't find the Goal State with 8 puzzle
- How do I progress from Depth First Search algorithm to Iterative Deepening with Binary Tree in C#
- How to I incorporate multithreading into IDA* search algorithm?
- How to use call_with_depth_limit/3
- Implementing Minimax search with Iterative Deepening
- How to stop alpha-beta with a timer in iterative deepening
- How to implement a transposition table for connect 4?
- Implement time limited iterative deepening search for chess program
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?
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*.