Questions tagged [iterative-deepening]
82 questions
0
votes
2 answers
What is the total number of nodes generated by Iterative Deepening depth first search and Breadth First search
What is the total number of nodes generated by Iterative Deepening depth first search and Breadth First search in terms of branching factor "b" and depth of shallowest goal "d"
Abhishek Rai
- 47
- 2
- 7
0
votes
1 answer
Iterative deepening search using my DFS
I have a DFS search and now I am trying to implement Iterative deepening search with this DFS but I really do not understand what should I do. I have tried many ways but finally I found It was wrong! Do you have any suggestion that what changes…
user2944170
0
votes
0 answers
Prolog stuck in Infinite loop using Iterative Deepening Search
I am writing a goal searching agent in Prolog. I have two predicates named search. One where the Problem has Type == explore and in the other Type == climb.
Note the Depth used is a constant = 10. The program was giving correct paths for all my…
digvijay91
- 697
- 1
- 6
- 21
0
votes
1 answer
JAVA: How to stop the execution of a function after a specific time?
I want to implement iterative deepening (incremental tree building). This is the part of my code I will ask about:
ExecutorService executorService = Executors.newSingleThreadExecutor();
Set> callables = new…
user2923339
- 121
- 2
- 10
0
votes
1 answer
Depth First Iterative deepening algorithm returning no results (in java)
I have a search algorithm that is supposed to parse the entire tree, find all results that could match a search query, and return them all as a list. I realize this isn't quite the point of the algorithm, but I'm doing this as a test with breadth…
zakparks31191
- 919
- 2
- 21
- 42
0
votes
2 answers
Infinite loop and recursion in Python
I am working on implementing an iterative deepening depth first search to find solutions for the 8 puzzle problem. I am not interested in finding the actual search paths themselves, but rather just to time how long it takes for the program to run.…
Amaranthine
- 3
- 1
- 4
-1
votes
1 answer
How do I progress from Depth First Search algorithm to Iterative Deepening with Binary Tree in C#
I have this method to perform depth first search on the binary tree
class Node
{
public Node Left { get; set; }
public Node Right { get; set; }
public int value { get; set; }
public void DepthFirst(Node node)
{
if (node…
G3n1t0
- 198
- 1
- 10