Opened 4 years ago

Last modified 4 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 slabbe)

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 4 years ago by slabbe

  • Branch set to u/slabbe/18987
  • Commit set to a86b42d048567484cf30c7a6f7838704615083e3

Preliminary version. Not ready for review.


New commits:

ee430a4Parallel computation of the nb of solutions for tilings
a86b42dTilings polyominos modulo 180 degrees rotations

comment:2 Changed 4 years ago by git

  • Commit changed from a86b42d048567484cf30c7a6f7838704615083e3 to 6fd4a8759641415b121b4a12aa6ecb711490b533

Branch pushed to git repo; I updated commit sha1. New commits:

406d876Parallel computation of the nb of solutions for tilings
6fd4a87Tilings polyominos modulo 180 degrees rotations

comment:3 Changed 4 years ago by slabbe

  • Description modified (diff)
Note: See TracTickets for help on using tickets.