Stack Overflow
Stack Overflow

Questions tagged [iterative-deepening]

82 questions
0
votes
1 answer

Iterative deepening and move ordering

As I understand, when implementing iterative deepening the best move at one depth should be used for ordering moves at higher depths. I have one issue with this: say I got the move m as my best move at the depth n, then when searching at the depth n…
user8277998
  • 147
  • 6
0
votes
1 answer

How is iterative deepening more efficient than just scanning the nodes at a specified depth level.

Isn't it redundant to rescan n-1 levels of nodes for each iteration?
nope
  • 223
  • 4
  • 15
0
votes
0 answers

Iterative Deepening Depth First Search doesn't find the Goal State with 8 puzzle

I tried to solve the 8 puzzle problem using Iterative Deepening Depth First Search but sometimes it works sometimes not. For example When I start from this state: 1, 2, 5, 0, 3, 4, 6, 7, 8 it finds the goal state. but it doesn't find it in this…
G3n1t0
  • 198
  • 1
  • 10
0
votes
0 answers

Java iterative deepening search gets stuck when limit=6

I'm trying to solve 15-puzzle (sliding puzzle) with iterative deepening search. This is my initial state : 1 2 12 13 5 6 7 8 9 3 4 0 11 14 15 10 And this is my goal state : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0 I have a class of node to represent…
Daniel16
  • 113
  • 8
0
votes
1 answer

Iterative deepening in minimax - sorting all legal moves, or just finding the PV-move then using MVV-LVA?

After reading the chessprogramming wiki and other sources, I've been confused about what the exact purpose of iterative deepening. My original understanding was the following: It consisted of minimax search performed at depth=1, depth=2, etc. until…
Ansel Chang
  • 183
  • 1
  • 1
  • 9
0
votes
0 answers

Iterative Deepening using recursion bug

This is iterative deepening search and I want to keep track of the nodes generated before the goal state. I am using RUNNING_TIME as a counter and then assign it to each node in the tree. The thing is, because o recursion RUNNING_TIME is incremented…
user181475
  • 41
  • 5
0
votes
1 answer

In which circumstances would I want to run BFS or DFS instead of IDDFS?

Question is about tree search. I believe I understand the differences between DFS, BFS, and IDDFS. In regards to Optimality, Completeness, Time Complexity, and Space Complexity IDDFS has a better performance for tree searches. So, when would I want…
dev-null
  • 1
0
votes
1 answer

How to find branching given time and depth for iterative deepening?

My professor posed the following question and I really don't know how to start solving this problem. Any help is really welcomed. Let the space of the tree be a tree with a uniform branching b (each node has exactly b children). We are exploring…
majzmaj
  • 9
  • 2
0
votes
1 answer

Iterative Deepening Search Java Implementation

I have been trying to implement an Iterative Deepening Search in Java. However, for some reason, not all of the children, for each node are being visited, resulting in incorrect results. Here is my code so far: public int IDS(Node start, Node…
Questionnaire
  • 656
  • 2
  • 11
  • 25
0
votes
1 answer

Depth limited search - logic - how do we stop backtracking?

Looking for some logic advice. I am running a depth limited search in order to get from a start state to an end state. I am expanding all possible moves from each node which at depths > 0 includes the source node (this is the problem). I have tried…
Shooresh
  • 105
  • 1
  • 11
0
votes
0 answers

recursion to explicit stack

I am trying to convert this recursive algorithm in an iterative one, it is the ida A* algorithm (from wikipedia). I have implemented it and the iterative version doesn't return the same result as the recursive version. function search(node, bound) …
blob
  • 439
  • 8
  • 21
0
votes
0 answers

8 puzzle iterative deep search implementation

I have implemented a depth first search (recursive) for the 8 puzzle problem in Java: protected PuzzleState depthFirstSearch(PuzzleState state) { PuzzleState start = this.getStartState(); PuzzleState goal = this.getGoalState(); …
nolags
  • 633
  • 1
  • 11
  • 30
0
votes
1 answer

How to apply Iterative Deepening Depth First Search(IDDFS) on Graphs

I tried to apply IDDFS on this graph by first making it in tree form and the result was this : At level 1: d,e,p At level 2: d,b,e,c,e,h,r,p,q At level 3: d,b,a,e,h,c,a,e,h,q,p,r,f,p,q At level 4: d,b,a,e,h,p,q,c,a,e,h,q,p,q,r,f,c,GOAL I…
Kashiii
  • 37
  • 2
  • 3
  • 13
0
votes
1 answer

Overhead effect in Iterative Deepening by increasing branching factor and depth

I am studying Iterative Deepening from this link. My main concern is with Overhead. That link says that The higher the branching factor, the lower the overhead of repeatedly expanded states There is no explanation given for this statement and…
Hammad Hassan
  • 1,192
  • 17
  • 29
0
votes
1 answer

Why is my implementation of Iterative Deepening Depth-First Search taking as much memory as BFS?

BFS requires O(b^d) memory, whereas IDDFS is known to run in only O(bd) memory. However, when I profile these two implementations they turn out to use exactly the same amount of RAM - what am I missing? I'm using a Tree class with a branching factor…
laurids
  • 931
  • 9
  • 24
1 2 3 4
5
6