Skip to content

feat: reverse all options of a game - #430

Open
plp127 wants to merge 15 commits into
vihdzp:masterfrom
plp127:aliu/canonical
Open

feat: reverse all options of a game#430
plp127 wants to merge 15 commits into
vihdzp:masterfrom
plp127:aliu/canonical

Conversation

@plp127

@plp127 plp127 commented Aug 11, 2026

Copy link
Copy Markdown
Contributor

Define unreverse (x : IGame) : IGame, which recursively reverses all the options of x until they can't be reversed anymore, so that unreverse x is a game equivalent to x which has no reversible options.


Unfortunately I wan't able to use the theorems from #124, since those are only for reversing moves once, but this definition needs to be able to reverse possibly infinitely many times, so I can't even use transitivity since that only chains finitely many times.

@vihdzp vihdzp left a comment

Copy link
Copy Markdown
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Sorry for the backlog, I'll try and review properly tonight.

Comment thread CombinatorialGames/Game/Canonical.lean Outdated
Comment thread CombinatorialGames/Game/Canonical.lean
Comment thread CombinatorialGames/Game/Canonical.lean
Comment thread CombinatorialGames/Game/Canonical.lean Outdated
Comment thread CombinatorialGames/Game/Canonical.lean
Comment thread CombinatorialGames/Game/Canonical.lean
Comment thread CombinatorialGames/Game/Canonical.lean Outdated
Comment thread CombinatorialGames/Game/Canonical.lean Outdated
Comment thread CombinatorialGames/Game/Canonical.lean Outdated
@vihdzp

vihdzp commented Aug 12, 2026

Copy link
Copy Markdown
Owner

Where does this leave #124? My major complaint there was that the theorems seemed hard to apply, and that seems to have been true...

@plp127

plp127 commented Aug 12, 2026

Copy link
Copy Markdown
Contributor Author

Where does this leave #124? My major complaint there was that the theorems seemed hard to apply, and that seems to have been true...

The lemmas are still probably useful to have, but I don't see how to get them to apply in this case where bypassing one game could generate infinitely many options, the n-th one having to be bypassed n times, and suddenly you have an infinite amount of bypassing all coming from just one option. How would I state such a lemma?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants