Opened 5 years ago

Last modified 5 years ago

#18987 closed enhancement

Parallel computation for TilingSolver.number_of_solutions — at Initial Version

Reported by: slabbe Owned by:
Priority: major Milestone: sage-6.9
Component: combinatorics Keywords:
Cc: Merged in:
Authors: Reviewers:
Report Upstream: N/A Work issues:
Branch: Commit:
Dependencies: Stopgaps:


The following computation takes a lot of time:

sage: from import QuantuminoSolver
sage: QuantuminoSolver(0).number_of_solutions()  # long time (about 30 days)

but we can make it faster by doing the computation in parallel... This ticket does this. It is motivated by a question I received from Nicolaas Neuwahl, the designer of the Quantumino puzzle:

can you tell me HOW MANY different quantumino-solutions exist?

The official website says there are over 10.000 potential solutions.

Change History (0)

Note: See TracTickets for help on using tickets.