Skip to main content

Timeline for ASCII connected hexagons

Current License: CC BY-SA 3.0

17 events
when toggle format what by license comment
Aug 12, 2015 at 11:10 vote accept trichoplax is on Codidact now
Aug 6, 2015 at 6:56 history edited Martin Ender
edited tags
Aug 6, 2015 at 0:05 history tweeted twitter.com/#!/StackCodeGolf/status/629080739653513216
Aug 5, 2015 at 23:52 answer added Level River St timeline score: 2
Aug 5, 2015 at 22:54 answer added royhowie timeline score: 2
Aug 5, 2015 at 22:53 answer added Martin Ender timeline score: 13
Aug 5, 2015 at 22:11 comment added Alex Van Liew @Fatalize: I dunno if it would be short or not, but a more "interesting" answer might do an actual search to see where it can place hexagons and thus get a more interesting output.
Aug 5, 2015 at 21:31 history edited trichoplax is on Codidact now CC BY-SA 3.0
Add leaderboard snippet
Aug 5, 2015 at 21:19 history edited trichoplax is on Codidact now CC BY-SA 3.0
Clarification following query
Aug 5, 2015 at 20:59 answer added Alex Van Liew timeline score: 7
Aug 5, 2015 at 18:46 answer added Allbeert timeline score: 4
Aug 5, 2015 at 15:34 answer added David Skrundz timeline score: 6
Aug 5, 2015 at 15:32 comment added trichoplax is on Codidact now @Fatalize The challenge is to minimise the number of bytes in the code. I don't mind if the patterns are simple, it will just be interesting to see what people try and what suits different languages.
Aug 5, 2015 at 14:31 comment added Fatalize You could still simply loop back and fill the lines below every time you reach the 50 chars limit
Aug 5, 2015 at 14:24 comment added trichoplax is on Codidact now @Fatalize my examples only work for an input of 6. For an input of 255 a horizontal row of hexagons won't fit in a 50 by 50 ASCII art.
Aug 5, 2015 at 14:17 comment added Fatalize I fear everyone will use the first example output pattern as it's probably the easiest to implement.
Aug 5, 2015 at 13:52 history asked trichoplax is on Codidact now CC BY-SA 3.0