Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Tracking Issue: Combinatorial Game Theory #18161

Open
16 tasks
LeoDog896 opened this issue Oct 24, 2024 · 0 comments
Open
16 tasks

Tracking Issue: Combinatorial Game Theory #18161

LeoDog896 opened this issue Oct 24, 2024 · 0 comments
Labels
t-set-theory Set theory

Comments

@LeoDog896
Copy link
Collaborator

LeoDog896 commented Oct 24, 2024

This keeps track of some missing concepts in combinatorial game theory, including mentions in PGame's future work section

  • The theory of dominated, reversible positions, and unique normal form for short games.
  • Analysis of basic domineering positions
  • Board-splitting utilities (for Chomp, Domineering, Nim, Sprouts)
  • Temperature
  • Loopy games
    • Stopper games
  • Impartialness via the equivalence of L/R moves
  • Strategy Stealing Argument (Chomp/Hex as examples)
  • Pairing Strategy for State games (unsure what the typical example is here for normal-play games, but perhaps Tic-Tac-Toe for a positional game?)
  • Non normal-play short games
    • Proof of the fundamental theorem of the trichotomy of the perfect states of combinatorial game theory

Game archive:

  • (discuss) Move domineering to the Archive?
  • Proof of Sim's inability to tie via Ramsey Theory
    • (hard) Proof of Sim winning 2nd player? (This seems to be done by computer search only)
  • Sprouts
    • Proof of winning state for Brussel Sprouts despite suboptimal play
@LeoDog896 LeoDog896 added the t-set-theory Set theory label Oct 24, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
t-set-theory Set theory
Projects
None yet
Development

No branches or pull requests

1 participant