tijko / Project-Euler

Solutions for project-euler problems.
MIT License
0 stars 0 forks source link

Heuristics #2

Open tijko opened 2 years ago

tijko commented 2 years ago

https://github.com/tijko/Project-Euler/blob/98f903856463cc321347546064bde38b0f106d3a/py_solutions_91-100/Euler_96.py#L94

Having wrote this code in under 15 minutes and run it first time after typing it out without error (and it worked gave the correct answer). Study possible heuristics. I'm not sure but I believe Sudoku puzzles fall under NP-hard classifications...

tijko commented 2 years ago

I was off in my description above, Sudoku is NP-Complete.