Thread

1. jwpapi · 1789683916 · focus · HN ↗

   I’m missing an actual explanation of how that works.

   I feel like we all had the idea, but how is all possible move sequences proven ?

   What if the possible scenarios are too big to proof or test.

   Like on a 2 dimensional game it’s easy, but you could make it multidimensional and introduce an unlimited amount of special rules, (if on a prime number dimension on 3 but not more prime numbers you are allowed to jump to another prime numbers with 3 but not less coordinates)

   How is bend protecting it? I was checkin github and the paper, but I was not motivated enough. I feel like an actual explanation of how proofing works is missing.

   For Lean I understand how it works, here not.

   1. developedby · 1789684267 · focus · HN ↗

      If your game is big, then your proof will need to be huge. It works basically the same as Lean.

Unofficial Hacker News client; not affiliated with Y Combinator.