Post

NDC Toronto 2026: Rust & Pickleball! πŸ¦€πŸŽΎ Join Bob McNaughton: "Use a Rust SAT Solver to play better pickleball!" Discover how formal logic and Rust can optimize your game strategy. πŸ“… ndctoronto.com/agenda 🎟️ ndctoronto.com/tickets 🍁 May 5-8! #RustLang #NDCToronto

ndctoronto.comUse a Rust SAT Solver to play better pickleball! | NDC Toronto 2026Many years ago, when I was an undergraduate CS student, my professor informed me that the Boolean Satisfiability problem was NP-Complete. I took this to mean it was not something I should waste any time thinking about or expect to be a useful tool in the future.

0 reposts0 likes

No replies yet.