In this study, we explore the efficiency of the Monte Carlo Tree Search
(MCTS), a prominent decision-making algorithm renowned for its effectiveness in
complex decision environments, contingent upon the volume of simulations
conducted. Notwithstanding its broad applicability, the algorithm's performance
can be adversely impacted in certain scenarios, particularly within the domain
of game strategy development. This research posits that the inherent branch
divergence within the Da Vinci Code board game significantly impedes
parallelism when executed on Graphics Processing Units (GPUs). To investigate
this hypothesis, we implemented and meticulously evaluated two variants of the
MCTS algorithm, specifically designed to assess the impact of branch divergence
on computational performance. Our comparative analysis reveals a linear
improvement in performance with the CPU-based implementation, in stark contrast
to the GPU implementation, which exhibits a non-linear enhancement pattern and
discernible performance troughs. These findings contribute to a deeper
understanding of the MCTS algorithm's behavior in divergent branch scenarios,
highlighting critical considerations for optimizing game strategy algorithms on
parallel computing architectures.

通过比较分析基于 CPU 和 GPU 的 MCTS 算法在分支分歧情况下的性能，我们发现 CPU 实现呈线性改进趋势，而 GPU 实现呈现出非线性的增强模式和明显的性能下降。这些发现对于优化并行计算架构上的游戏策略算法具有重要的考虑价值。