arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1911.03388cs.AI
收藏

最佳优先博弈树剪枝算法的不同观点

A different take on the best-first game tree pruning algorithms

Indian Institute of Technology, Dharwad(印度达尔瓦德理工学院)

Ishan Srivastava

摘要:

自alpha-beta剪枝算法被发现以来,一直是博弈树搜索中的热门算法。在文献中提出了许多增强功能,并且通常无法确定哪一种最适合实现。一个特定的增强可能需要太长的时间来微调它的超参数,或者决定它是否会因为内存限制而没有太大的不同。另一方面是最好的第一次修剪技术,主要是臭名昭著的SSS* 算法的对应物,该算法在其发现时被证明是破坏性的,但逐渐被淘汰,因为太内存密集,并具有更高的时间复杂度。后来的研究并没有看到最好的第一种方法与基于深度优先的增强完全不同,但两者似乎都是过渡性的,因为最好的第一种方法可以被看作是具有一定增强功能的深度优先方法,并且随着计算机功能的不断增长,SSS* 似乎也不会对内存造成负担。即便如此,似乎很难理解SSS* 算法的本质,为什么它会做它所做的事情,并且它被称为太复杂而无法在智力水平上理解,可视化和理解。本文试图弥合这一差距,并提供一些实验结果,比较两者与最有前途的进步。

英文摘要:

The alpha-beta pruning algorithms have been popular in game tree searching ever since they were discovered. Numerous enhancements are proposed in literature and it is often overwhelming as to which would be the best for implementation. A certain enhancement can take far too long to fine tune its hyper parameters or to decide whether it is going to not make much of a difference due to the memory limitations. On the other hand are the best first pruning techniques, mostly the counterparts of the infamous SSS* algorithm, the algorithm which proved out to be disruptive at the time of its discovery but gradually became outcast as being too memory intensive and having a higher time complexity. Later research doesn't see the best first approaches to be completely different from the depth first based enhancements but both seem to be transitionary in the sense that a best first approach could be looked as a depth first approach with a certain set of enhancements and with the growing power of the computers, SSS* didn't seem to be as taxing on the memory either. Even so, there seems to be quite difficulty in understanding the nature of the SSS* algorithm, why it does what it does and it being termed as being too complex to fathom, visualize and understand on an intellectual level. This article tries to bridge this gap and provide some experimental results comparing the two with the most promising advances.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑