<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>博弈论 on Answer</title>
    <link>https://answer.freetools.me/tags/%E5%8D%9A%E5%BC%88%E8%AE%BA/</link>
    <description>Recent content in 博弈论 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 23:23:30 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%8D%9A%E5%BC%88%E8%AE%BA/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>博弈论算法为何能用数学公式预测胜负从Nim博弈到极大极小算法的完整LeetCode通关指南</title>
      <link>https://answer.freetools.me/%E5%8D%9A%E5%BC%88%E8%AE%BA%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8%E6%95%B0%E5%AD%A6%E5%85%AC%E5%BC%8F%E9%A2%84%E6%B5%8B%E8%83%9C%E8%B4%9F%E4%BB%8Enim%E5%8D%9A%E5%BC%88%E5%88%B0%E6%9E%81%E5%A4%A7%E6%9E%81%E5%B0%8F%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 23:23:30 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%8D%9A%E5%BC%88%E8%AE%BA%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8%E6%95%B0%E5%AD%A6%E5%85%AC%E5%BC%8F%E9%A2%84%E6%B5%8B%E8%83%9C%E8%B4%9F%E4%BB%8Enim%E5%8D%9A%E5%BC%88%E5%88%B0%E6%9E%81%E5%A4%A7%E6%9E%81%E5%B0%8F%E7%AE%97%E6%B3%95%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>一篇深度讲解博弈论算法的完整指南，从Nim博弈的XOR必胜策略到Sprague-Grundy定理，再到极大极小算法与Alpha-Beta剪枝，结合LeetCode经典题目（292/877/486/1140/1406/1510等）的Java实现与复杂度分析。</description>
    </item>
  </channel>
</rss>
