We’re rewarding the question askers & reputations are being recalculated! Read more.

Questions tagged [branching-factors]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
4
votes
1answer
352 views

Algorithms for games with very high branching factors (Connect6)

Connect6 is an example of a game with a very high branching factor. It is about 45 thousand, dwarfing even the impressive Go. What algorithms can you use on games with such high branching factors? I ...
1
vote
1answer
143 views

Why was Go a harder game for an AI to master than Chess?

AI became superior to the best human players in chess around 20 years ago (when the 2nd Deep Blue match concluded). However, it took until 2016 for an AI to beat the Go world chess champion, and this ...
5
votes
2answers
730 views

Are leaf nodes included in the calculation of average branching factor for search trees?

In the search tree below, there are 11 nodes, 5 of which are leaves. There are 10 branches. Is the average branching factor given by 10/6, or 10/11? Are leaves included in the calculation? ...
5
votes
1answer
565 views

Is the 'direction' considered, when determining the branching factor in bidirectional search?

If I am correct, the branching factor is the maximum number of successors of any node. When I am applying bidirectional search to a transition graph like this one below If 11 is the goal state and I ...
2
votes
1answer
78 views

How to deal with huge branching factors in real-time?

Some time ago playing chess was challenging for algorithms, then Go game which is vastly more complex than compared to chess. How about playing RTS game which have enormous branching factors limited ...