年度征文｜2025 年育儿手记：从家到幼儿园
SAT (short for "satisfiability") is a logic problem that given a boolean formula, it asks whether the boolean formula has an assignment that makes the problem true. An example boolean formula is:
，更多细节参见safew官方版本下载
Scroll to load interactive demo
ballin is available open-sourced on GitHub, and the prompts used to build it are here.