search

xcsp3team / pycsp3

A Python Library for modeling combinatorial constrained problems
https://www.pycsp.org
MIT License
60 stars 9 forks source link

Feature Request: Possible Acceleration? #53

Open SMUEric1127 opened 1 week ago

SMUEric1127 commented 1 week ago

Hi team,

Thank you so much for creating this library, do guys know what are some possible way to speed up the solver() and satisfy()? I followed the tutorial with Social Golfer Problems with a relatively small instance (same as tutorial) and it still took longer time. In cases where there would be larger instance, what are possible ways I can speed up this process?

Thank you!

xcsp3team commented 1 week ago

The problems we have to solve are typically NP-complete, meaning that there does not exist any known polynomial algorithms to solve them. Since a few decades, researchers are trying to develop the most possible effective techniques.