Structured thesis with preliminary math or code; actively developing.
Digital Garden
🌿 What is a Digital Garden?
Rooted in Andy Matuschak & Maggie Appleton's evergreen note taxonomy: articles are not ephemeral chronologies, but living organisms tended over time:
- 🌱 Seedling: Raw inspiration, reading logs, open questions
- 🌿 Budding: Structured thesis, early proofs, actively revised
- 🌳 Evergreen: Closed logic, enduring, foundational reference
- 🔬 Speculative: Empirical hypotheses coupled with lab instruments
Scope note. This is an English overview of a Chinese conceptual article. Its code fragments and game examples explain candidate approaches; they are not evidence of a tested agent or competitive performance.
Why more players change the problem
In a two-player zero-sum game, one player’s gain is the other’s loss, which supports familiar minimax reasoning. In a multiplayer or non-zero-sum game, players can have partially aligned interests, form temporary coalitions, or become one another’s main threat. Search must therefore account for several utility functions and changing strategic relationships.
The source introduces Nash equilibrium, Pareto efficiency, and coalition value as useful concepts for describing these settings. They answer different questions: whether a strategy profile is stable against unilateral changes, whether a different outcome could improve someone without harming others, and what a coalition can achieve together.
Search approaches in the article
- Paranoid search treats all other players as if they were cooperating against the current player. This reduces a multiplayer node to a conservative two-sided view, but can be overly pessimistic.
- MaxN search assumes that each player selects actions to maximize their own utility. It preserves separate utility components but can be more expensive and sensitive to the evaluation function.
- Shallow pruning and Best Reply Search are discussed as ways to manage the branching factor and focus computation on strategically relevant replies.
The article also introduces Shapley value as one way to reason about how a coalition’s value might be allocated among its members. These tools make different assumptions; there is no single search method that is appropriate for every multiplayer game.
What would need evaluation
An operational comparison would define the rules, player count, opponents, compute budget, and outcome metric, then compare repeated games against stated baselines. The source offers algorithm sketches and application ideas for games such as social deduction and poker, but no such benchmark protocol or results.
The complete Chinese article contains the code examples and longer discussion of coalition formation and negotiation.
Article concept network
Explore sections and explicit terms from the text. Dashed lines connect repeated concepts, not causal claims.
13 / 13 nodes · marked terms and named concepts from the text
Search and Strategy in Multiplayer Games
Read in context ↗