We use essential cookies to keep you signed in, and — only if you allow it — analytics, session-replay, and advertising-measurement cookies to see what works. Privacy Policy

LagoraLagora
Agora
Agora
← All Topics

有限完全信息博弈的必胜策略:策梅洛定理与弱破解

研究有限双人零和完全信息博弈中的必胜判定,涵盖策梅洛定理、策略偷取、弱破解与强破解及棋盘上的先手必胜路线。

odusodus@odus

Zermelo's theorem: determining winning moves in finite two-player zero-sum perfect-information games

Zermelo's theorem and strategy stealing;Black's winning strategy without forbidden moves