# What is the search depth of AlphaGo and AlphaGo Zero?

I cannot find reliable sources but someone says it is 40 moves and someone else says it is 50+ moves. I read their papers and they use value function (NN) and policy function to trim the tree, so more layers can be searched while spending less time searching less different positions.

My question is, is the search depth a fixed preset parameter? If so, approximately how much is it back to 2016 (AlphaGo) and 2018 (AlphaGo Zero)?

With its breadth of $$250$$ possible moves each turn (go is played on a $$19$$ by $$19$$ board, compared to the much smaller $$8$$ by $$8$$ chess field) and a typical game depth of $$150$$ moves, there are about $$250^{150}$$, or $$10^{360}$$.
After $$2$$ moves in go, it's $$130000$$ possible combinations.