Timeline for Generate all the free polyominoes who's width and height is no larger than 8
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 9 at 4:44 | comment | added | timeslidr | Some representation that can be worked with is fine. For my game, I'm using bitboards so as long as they can get converted back into a bitboard, I don't mind how they are stored. | |
| Sep 8 at 19:51 | answer | added | Shadowtrot | timeline score: 5 | |
| Sep 8 at 19:09 | comment | added | user555045 | When you say you "need all the free polyominoes", do you mean you need an explicit list of them, or more generally "some representation that can be worked with" - such as (I don't know whether this specific representation will work) a ZDD that represents the entire set of them in exponentially smaller space than the number of things it represents and can be queried in various ways. | |
| Sep 8 at 10:20 | history | edited | toolic | CC BY-SA 4.0 |
deleted 6 characters in body; edited tags
|
| Sep 8 at 10:12 | answer | added | Martin Fuller | timeline score: 5 | |
| Sep 8 at 8:21 | history | became hot network question | |||
| Sep 8 at 5:00 | comment | added | qwr | Also see if any of the algorithms are parallelizable | |
| Sep 8 at 4:36 | history | edited | timeslidr | CC BY-SA 4.0 |
Added info about it being very slow in Visual Studio Community
|
| Sep 8 at 4:35 | comment | added | timeslidr | I'll give a shot a report back. | |
| Sep 8 at 4:24 | comment | added | qwr | Are you running with Pypy? That's a free 5x speedup right there. I would suggest a rewrite in C++ or Rust. Python is not good for computational tasks | |
| Sep 8 at 2:24 | answer | added | Confettimaker | timeline score: 6 | |
| S Sep 8 at 0:17 | review | First questions | |||
| Sep 8 at 1:05 | |||||
| S Sep 8 at 0:17 | history | asked | timeslidr | CC BY-SA 4.0 |