Questions tagged [tree-search]
46 questions
0
votes
0 answers
Where to do "huge" graph calculations - Flutter, php
I'm planning on doing an application that create the shortest possible path to some interest points.
Each point is an activity separated from the other by a distance (e.g. p1 --50m--> p2). Later there will be a wait time for each point so it'll…

Akainn Z
- 51
- 5
0
votes
1 answer
Tower defense money generation optimization
I am considering trying to optimize money generation ("farming") in the tower defense game Bloons TD 6. For simplicity, only consider a small set of farm types, which cost a certain amount of money to buy and produce a set amount of money per round…

qwr
- 9,525
- 5
- 58
- 102
0
votes
1 answer
Is this a known forest search algorithm? If it is, what is its name?
The problem is: Given this kind of forest:
if we have a node, how can we get the descendants of it?
I thought this algorithm that I think is pretty efficient when talking about reading all descendants adding some little overhead in the writing(it's…
user18101096
0
votes
1 answer
Does A* search expand the same node more than once?
The A* search seems to recalculate the f-value for Arad, Sibiu and other repeated states, which it shouldn't be doing since these nodes have already been expanded and are in the closed state. So what am I missing here? (Image from Russel and Norvig…

Kirtiman Sinha
- 843
- 8
- 19
0
votes
1 answer
What is the concept of "Last Good Reply" and "Rapid Action Value Estimation" in Monte Carlo Simulation?
I have developed a simple hex player based on Monte Carlo Tree Search for the game of Hex. Now I want to extend the hex player using RAVE (Rapid Action Value Estimation) and LGP (last good reply). The articles are here and here.
I was wondering if…

Masoud Masoumi Moghadam
- 1,094
- 3
- 23
- 45
0
votes
2 answers
Tree search in Clojure core.logic
I've been puzzled by a modelisation problem for some time and I have to confess I have no idea how I could "properly" solve it in core.logic.
It is very easy to state: given a tree (acyclic unidirectional oriented graph) and a vertex in it, how do…

piotr-yuxuan
- 36
- 4
0
votes
2 answers
Unsuccessful binary tree search
I know that for a successful search, the average search time over all inputs containing n keys, using binary trees , is in Big O (lg n), but will it this result hold for an unsuccessful research?

ACE
- 41
- 1
0
votes
1 answer
What's the time complexity of Monte Carlo Tree Search?
I'm not sure whether this question should go on stackoverflow or cs.stackexchange.com, so please let me know if I should move it.
I'm trying to find the time complexity of Monte Carlo Tree Search (MCTS). Googling doesn't help, so I'm trying to see…

bigblind
- 12,539
- 14
- 68
- 123
0
votes
1 answer
Implementing tree with different data types of nodes
I have to combinatorially count all possible cases for a task. I want to make a tree for that purpose. There are several jobs and each job has several sub jobs. There are many agents available to do the jobs. Suppose Job1 Subjob1 can be done by…

userzizzy
- 159
- 1
- 2
- 11
0
votes
3 answers
Tree search function
Any node can have any number of children. To search this tree i wrote something like this
function Search(key, nodes){
for (var i = 0; i < nodes.length; i++) {
if (nodes[i].key == key) {
return nodes[i];
}
…

sarsnake
- 26,667
- 58
- 180
- 286
0
votes
1 answer
How to find, where the Javascript keeps an Object I am interested in?
There is a website, which does POST, and I want to know, where parameters are stored. I need it to hack them, edit before posting. Scripts are huge and obfuscated, so I can't find the Objects I need just by reading the source code.
I've tried to…

Nakilon
- 34,866
- 14
- 107
- 142
0
votes
0 answers
In a DOM, how to find the right-most element that is left of a given element and matches criteria using lxml or xpath
I'm working on a function that determines if the content of a given html element - el - in an lxml ElementTree is the leading content of a line in a rendered HTML page. To do this, I'm trying to find the right-most block level element that is left…

Bill Bushey
- 143
- 1
- 6
-1
votes
2 answers
TreeNode Search Javascript
I have a class called TreeNode
class TreeNode {
constructor(name) {
// Name of the node visible to user. It is string
self.name = name;
// Children of the node. it is array of TreeNode
self.children = [];
// If this field is…

DJ Danny
- 9
- 1
- 4
-1
votes
1 answer
AI tree search. Time complexity of 8-queen, by placeing one by one without attack
One approach to achieve goal state is to "add a queen to any square in the leftmost empty column such that it is not attacked by any other queen". And this approach will have a state space of 2057 (also wondering How to compute this?)
What is the…

Wendy
- 65
- 8
-1
votes
3 answers
searching a binary tree
I'm writing an iterative function to search a binary tree for a certain value. This is localized to signed ints until I get into how to genericize classes.
Assume that my class is BinarySearchTree, and it has a pointer to the root node of the tree.…

jkeys
- 3,803
- 11
- 39
- 63