Opened 5 years ago
Last modified 5 years ago
#18987 closed enhancement
Parallel computation for TilingSolver.number_of_solutions — at Version 3
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: | u/slabbe/18987 (Commits) | Commit: | 6fd4a8759641415b121b4a12aa6ecb711490b533 |
Dependencies: | Stopgaps: |
Description (last modified by )
The following computation takes a lot of time:
sage: from sage.games.quantumino 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 also simplify the computation by avoiding to compute 4 times the same solution (obtained by rotation of angle pi of the 5x8x2 box).
Change History (3)
comment:1 Changed 5 years ago by
- Branch set to u/slabbe/18987
- Commit set to a86b42d048567484cf30c7a6f7838704615083e3
comment:2 Changed 5 years ago by
- Commit changed from a86b42d048567484cf30c7a6f7838704615083e3 to 6fd4a8759641415b121b4a12aa6ecb711490b533
comment:3 Changed 5 years ago by
- Description modified (diff)
Note: See
TracTickets for help on using
tickets.
Preliminary version. Not ready for review.
New commits:
Parallel computation of the nb of solutions for tilings
Tilings polyominos modulo 180 degrees rotations