News for hackers. Stuff that matters.

A comment on Brute-forcing a seemingly simple number puzzle. Parent comment

Re:Brute-forcing a seemingly simple number puzzle by taeric on Wednesday December 05, 2018 @11:56AM (#18610059)
I posted it top-level, but I'll post here, as well. Look into Knuth's discussion of Exact Cover problems. He has a very elegant algorithm for this style of problem that, I believe, is quite hard to beat. (Would love for someone to prove me wrong.)
[ Parent | on HN ]
Re:Brute-forcing a seemingly simple number puzzle by jimsmart on Thursday December 06, 2018 @06:13AM (#18617038)
Sure, agreed. But I guess it depends on whether one wishes to stick with a search algorithm, and improve upon it, or, whether one wants to implement a completely different algorithm instead.
[ Parent | on HN ]
Re:Brute-forcing a seemingly simple number puzzle by taeric on Thursday December 06, 2018 @09:31AM (#18618298)
The other algorithm is still a search one. Just really clever in how it searches.
[ Parent | on HN ]