You correctly describe the problems of coordinating the selection of the best result produced. But there’s another big problem: coordinating the division of work.
When you add another player to a huge team of 5000 people, he won’t start exploring a completely new series of moves no-one else had considered before. Instead, he will likely spend most of his time considering moves already considered by some of the existing players. That’s another reason why his marginal contribution will be so low.
Unlike humans, computers are good at managing divide-and-conquer problems. In chess, a lot of the search for the next move is local in the move tree. That’s what makes it a particularly good example of human groups not scaling where computers would.
You correctly describe the problems of coordinating the selection of the best result produced. But there’s another big problem: coordinating the division of work.
When you add another player to a huge team of 5000 people, he won’t start exploring a completely new series of moves no-one else had considered before. Instead, he will likely spend most of his time considering moves already considered by some of the existing players. That’s another reason why his marginal contribution will be so low.
Unlike humans, computers are good at managing divide-and-conquer problems. In chess, a lot of the search for the next move is local in the move tree. That’s what makes it a particularly good example of human groups not scaling where computers would.