Thank you for your interest! We will keep this in mind for future demos and documentation.
Sudoku is a form of constraint satisfaction problem. You might be interested in our Map Coloring example, which is another constraint satisfaction problem. The problem formulation for these two cases would be similar.
If any Leap users have developed code for solving Sudoku problems, I encourage you to link to them in this discussion!
You might be interested in this 2010 paper on the D-Wave website, which discusses Sudoku problems in the context of the D-Wave system (at a high level):
Comments
Hello Branislav,
Thank you for your interest! We will keep this in mind for future demos and documentation.
Sudoku is a form of constraint satisfaction problem. You might be interested in our Map Coloring example, which is another constraint satisfaction problem. The problem formulation for these two cases would be similar.
If any Leap users have developed code for solving Sudoku problems, I encourage you to link to them in this discussion!
Hi Branislav,
You might be interested in this 2010 paper on the D-Wave website, which discusses Sudoku problems in the context of the D-Wave system (at a high level):
https://www.dwavesys.com/media/vbklsvbh/weightedmaxsat_v2.pdf
Please sign in to leave a comment.