4 ms·
Aphyr solved this in an interview with types years ago https://aphyr.com/posts/342-typing-the-technical-interview https://aphyr.com/posts/342-typing-the-technic
by exdsq 5y ago
Aphyr solved this in an interview with types years ago https://aphyr.com/posts/342-typing-the-technical-interview https://aphyr.com/posts/342-typing-the-technical-interview
- nixpulvis 5y agoI quick re-skim of this leads me to believe the OP solution would be considerably faster and more tractable for large N. That said, it doesn't appear to be an exact solution, as a classical recursive enumeration would be. I was personally really hoping to learn about a new geometric trick to exploit for a complete solution. I even took out a chess set again and everything, lol. Or am I misunderstanding something here?
- exdsq 5y agoSorry I was being sarcastic, it's the same N-Queens problem but just done in a really really obscure way along with a great story.