enclose.horse is NP Complete - YouTube
youtube.com · 2,717 words · saved by 1 readers
Follow along using the transcript. Follow along using the transcript.
We horse around while proving that the game enclose.horse is NP-complete. >> What I miss? >> Oh, uh I don't know. >> Whatever. >> This one looks kind of hard, though. >> Bro, what are you doing? >> I don't know, man. It's kind of hard. >> Whatever. >> All right. >> Yo, what is this? >> Oh, this? >> Yeah. >> It's called enclosed.horse. It's uh life-changing game, dude. >> Mhm. >> I I started playing like a month ago. Haven't quit since. >> But it looks really easy. You're just putting blocks down. >> It might look easy, but because you don't know what the best possible score is, like trying…
saved by
related reading
- Integer programming easily encloses horsedynomight.substack.com
- P vs. NP and the Computational Complexity Zooyoutube.com
- Reasons to believescottaaronson.blog
- P versus NP problem - Wikipediaen.wikipedia.org
- AI researchers talk continual learning over a game of HORSEyoutube.com
- pnp.pdfscottaaronson.com
- P vs. NP for Dummiesscottaaronson.blog
- P vs NP and its application to zero knowledge proofs | RareSkillsrareskills.io
- Game Emulation via Neural Networkmadebyoll.in
- Games and Puzzles as Multicomputational Systems-Stephen Wolfram Writingswritings.stephenwolfram.com
- The hidden beauty of the A* algorithmyoutube.com
- Complete Search with Recursion · USACO Guideusaco.guide