Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

[stub for offtopicness]


Backtracking is not a fast SAT solver.



OTOH, you can't write a Boolean SAT solver without backtracking.


sorry this is not fast



"* SAT solver * is a computer program which aims to solve the Boolean satisfiability problem", has nothing to do with the SAT aptitude tests.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: