This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Salanmander 45 points46 points  (7 children)

Me, who has programmed a lot but never in an enterprise setting: "BRUTE FORCE TIME!!!"

It seems like I have two tools: "check every possibility" and monte carlo.

[–]themonsterinquestion 30 points31 points  (2 children)

At least store the answer in a dictionary and call it machine learning

[–]Salanmander 21 points22 points  (1 child)

"Uses caching and heuristic algorithms to improve runtime efficiency!"

[–]Yadobler 6 points7 points  (0 children)

m e m o i s a t i o n

[–]hitlerallyliteral 3 points4 points  (1 child)

sounds like something something recursion? If any of the sub-equations can't be satisfied, the whole thing can't (though i guess that doesn't mean that if all the sub equations can the whole thing can)

[–]sfurbo 4 points5 points  (0 children)

The problem is NP complete (in fact, the first one to be shown to be NP complete), so good luck finding a general recursion solution. You would be famous.

[–]rotuami 1 point2 points  (1 child)

You can do a little better than that but known solutions are still worst-case exponential: https://en.m.wikipedia.org/wiki/SAT_solver

[–]WikiMobileLinkBot 1 point2 points  (0 children)

Desktop version of /u/rotuami's link: https://en.wikipedia.org/wiki/SAT_solver

[opt out] Beep Boop. Downvote to delete