Skip to main content

Timeline for answer to Sandbox for Proposed Challenges by Sp3000

Current License: CC BY-SA 3.0

Post Revisions

45 events
when toggle format what by license comment
May 6, 2015 at 21:15 history wiki removed Martin EnderMod
May 3, 2015 at 15:37 history made wiki Post Made Community Wiki by Martin EnderMod
Feb 8, 2015 at 14:58 history edited Sp3000 CC BY-SA 3.0
added 117 characters in body
Feb 8, 2015 at 14:39 history edited Sp3000 CC BY-SA 3.0
added 111 characters in body
Feb 8, 2015 at 12:44 history edited Sp3000 CC BY-SA 3.0
added 87 characters in body
Feb 8, 2015 at 12:25 history edited Sp3000 CC BY-SA 3.0
added 54 characters in body
Feb 8, 2015 at 11:53 history edited Sp3000 CC BY-SA 3.0
added 10 characters in body
Feb 8, 2015 at 10:31 history edited Sp3000 CC BY-SA 3.0
added 59 characters in body
Feb 8, 2015 at 9:00 history edited Sp3000 CC BY-SA 3.0
added 130 characters in body
Feb 8, 2015 at 8:31 history edited Sp3000 CC BY-SA 3.0
deleted 35 characters in body
Feb 8, 2015 at 8:10 history edited Sp3000 CC BY-SA 3.0
added 9 characters in body
Feb 8, 2015 at 4:53 history edited Sp3000 CC BY-SA 3.0
deleted 1 character in body
Feb 8, 2015 at 3:59 history edited Sp3000 CC BY-SA 3.0
added 6 characters in body
Feb 7, 2015 at 13:50 history edited Sp3000 CC BY-SA 3.0
added 103 characters in body
Feb 6, 2015 at 3:36 history edited Sp3000 CC BY-SA 3.0
added 49 characters in body
Feb 5, 2015 at 23:35 history edited Sp3000 CC BY-SA 3.0
added 167 characters in body
Feb 5, 2015 at 23:32 comment added Sp3000 @stokastic Hmm good question... I'm thinking maybe 32-bit int range?
Feb 5, 2015 at 20:59 comment added stokastic Is there min/max values for the coordinates?
Feb 5, 2015 at 14:48 history edited Sp3000 CC BY-SA 3.0
added 860 characters in body
Feb 5, 2015 at 8:49 history edited Sp3000 CC BY-SA 3.0
deleted 84 characters in body
Feb 5, 2015 at 1:49 comment added user16991 Moving to 2D might simplify rotations greatly, while retaining enough complexity to be worth a challenge.
Feb 1, 2015 at 1:56 history edited Sp3000 CC BY-SA 3.0
added 76 characters in body
Feb 1, 2015 at 1:11 history edited Sp3000 CC BY-SA 3.0
added 206 characters in body
Feb 1, 2015 at 1:04 history edited Sp3000 CC BY-SA 3.0
added 206 characters in body
Jan 31, 2015 at 11:44 history edited Sp3000 CC BY-SA 3.0
added 172 characters in body
Jan 31, 2015 at 9:42 history edited Sp3000 CC BY-SA 3.0
added 87 characters in body
Jan 31, 2015 at 2:07 history edited Sp3000 CC BY-SA 3.0
deleted 27 characters in body
Jan 31, 2015 at 1:49 history edited Sp3000 CC BY-SA 3.0
added 698 characters in body
Jan 29, 2015 at 0:55 history edited Sp3000 CC BY-SA 3.0
deleted 1067 characters in body
Jan 29, 2015 at 0:45 comment added Sp3000 C. Each cube automatically connects to all of its neighbours
Jan 29, 2015 at 0:45 comment added Sp3000 B. Each cube is connected to the cube it was built off
Jan 29, 2015 at 0:44 comment added Sp3000 A. Connections should be explicitly given via a function call
Jan 29, 2015 at 0:43 comment added Sp3000 Connections/adjacency:
Jan 29, 2015 at 0:43 comment added Sp3000 2. Any number of structures
Jan 29, 2015 at 0:42 comment added Sp3000 1. Exactly one structure
Jan 29, 2015 at 0:42 comment added Sp3000 Number of cube structures:
Jan 28, 2015 at 23:45 comment added Sp3000 III. Something else (leave a comment below)
Jan 28, 2015 at 23:44 comment added Sp3000 II. Fastest algorithm
Jan 28, 2015 at 23:43 comment added Sp3000 I. Code golf (fewest bytes)
Jan 28, 2015 at 23:43 comment added Sp3000 Winning criteria:
Jan 28, 2015 at 8:36 comment added trichoplax is on Codidact now B. Attachable unit cubes (for simplicity)
Jan 28, 2015 at 8:35 comment added trichoplax is on Codidact now A. Lego pieces.
Jan 25, 2015 at 21:11 comment added trichoplax is on Codidact now 5. Controller-mediated build-your-own data structure
Jan 25, 2015 at 21:07 comment added trichoplax is on Codidact now 2. Lego pieces/attachable cubes
Jan 24, 2015 at 18:36 history answered Sp3000 CC BY-SA 3.0