Editing Branching factor (section)

== References ==
{{reflist|refs=
<ref name="wired">{{cite web| title=The Mystery of Go, the Ancient Game That Computers Still Can't Win
|url= https://www.wired.com/2014/05/the-world-of-computer-go/
|first=Alan|last= Levinovitz  |date= 12 May 2014 |publisher= [[Wired (website)|Wired]]
|quote=The rate at which possible positions increase is directly related to a game’s “branching factor,” or the average number of moves available on any given turn. Chess’s branching factor is 35. Go’s is 250. Games with high branching factors make classic search algorithms like [[minimax]] extremely costly.
|accessdate= 2014-06-02}}</ref>
}}

[[Category:Trees (data structures)]]
[[Category:Analysis of algorithms]]
[[Category:Combinatorial game theory]]
[[Category:Computer chess]]