Not just in your opinion. The search space is exponentially larger in go because you can place a piece on any unoccupied square.<p>&quot;The search space for Go&#x27;s game tree is both wider and deeper than that of chess. It has been estimated to be as big as 10^170 compared to 10^50 for chess, making the normal brute-force game tree search algorithms much less effective. &quot;<p><a href="http:&#x2F;&#x2F;ai-depot.com&#x2F;LogicGames&#x2F;Go-Complexity.html" rel="nofollow">http:&#x2F;&#x2F;ai-depot.com&#x2F;LogicGames&#x2F;Go-Complexity.html</a><p>To provide a little more perspective. The estimated number of atoms in the observable universe is about 4*10^80. So we have no hope of ever being capable of &quot;solving&quot; go by mapping out every possible game state AKA &quot;brute forcing&quot; the game.<p><a href="https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Shannon_number" rel="nofollow">https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Shannon_number</a>