so when I say "I'll trade 3X for 4Y" that should make a link from my send-3X to anyone who is willing to receive 3-or-fewer X, and a link from anyone sending 4-or-more Y to my receive-4Y
if implementation is all that's stopping you from using it, I'd be up for trying my hand at augmenting the edge generator to handle the cases we've discussed
Tetris Wars
In this KoTH, you will be playing Tetris with another player on a standard grid size. Completed lines will not be removed. A player gets a point by having more pieces than the other on a completed line. You win a game by having more points than your opponent.
You will play each o...
yes, probably, but it's not strictly worse; it does have the advantage that you have to speculate if you want to take the other player's moves into account
so in theory, a bot that tries to strike a balance between maxing its own score and screwing the other player could beat a bot that just maxes its own score
Cool. I really want to see alternate solutions. If you run Martin's solution with the graphical controller, you can see some really suboptimal behavior
He did say ahead of time that he was going to make a simple solution, though, so I expected that. However, you can probably beat him
One thing he does that I didn't expect to see is to leave one or two squares unsearched, go all the way across the map, and come back to sweep them up at the end
Yeah, though I don't think any stock algorithms are directly applicable; that was the main point of having a sight radius, multiple people, and the death rules
I asked my facebook (which includes a lot of strong females) if it's misogynistic to mock Microsoft by writing 'Ms Windows'. ... And no red-flags! .... ccuz iz a wee girly Oh Esss.
If your code conforms to the spec, the only difference in using the controller and not using it is that you'll get some stuff hitting your program's STDIN, and you'll have a chance to see the graphical output
So you can either not use it at all, use it and ignore its input just for the visual, or rely on it to enforce the death rules and deal with the sight radius for you
@Sparr I added Penrose tiling to my framework. Still working on making it expand on demand. I'm using the pentagrid construction method, so in principle it should be simple, but I've obviously failed to understand something.
p3 seems to be fairly rare. I excluded periods 2,5,7,2*5,12,2*7 and ran overnight and got 19x p3, 108x p4, 41x p6 (although not sure yet how many are 2*3) and a few multiples.
Also 35 which hadn't stabilised in 400 gens. Penrose seems to be the closest I've seen to far to the original square grid in terms of the balance between everything stabilising quickly (most of them) and almost everything being unstable (rhombille).
I currently have a few ideas for questions involving kolmogorov complexity, mostly how to output song lyrics in the shortest method (example: Diggy Diggy Hole by the Yogscast, http://yogscast.wikia.com/wiki/Diggy_Diggy_Hole_(Song), mainly because I've had it stuck in my head since the day of rele...
Could someone have a final look at this proposal? Especially if anything is unclear of if the post can be shortened? I'll be posting in 30 - 60 minutes.
Domino Circuits
code-challenge logic-gates
It is possible to build simple logic gates from dominoes. Hence, by combining these or otherwise, arbitrary binary functions can be computed with dominoes.
But of course, everyone who has played with dominoes (except Robin Paul Weijers) has experience...
Suppose I write a code-golf question. How long should I wait before accepting the shortest answer? One week? Two days? More? I checked the FAQ, but couldn't find any information on this topic. Is there a general rule or is it just when the question asker feels like it?
@MartinBüttner all sounds good - the only minor ambiguity is the following:
I'd change
"No circuit must contain"
to
"No circuit is permitted to contain"
I think everyone would know what it means anyway, it's just technically someone could decide to interpret it as there is no requirement for more, rather than there is a requirement for less
@MartinBüttner as to the entry barrier, I like the inclusion of example logical gates so that a valid entry can be made simple by combining these. This allows people to make a working entry fairly easily, and then focus on the interesting bit...
@MartinBüttner It might also be useful to point people into a direction as to how to create a boolean function using standard logical gates. That, along with the examples will makje for an easy simple solution.
Jenga code
I think everyone knows what Jenga is.
As per Wikipedia:
Jenga is a game of physical and mental skill [...] During the game, players take turns removing one block at a time from a tower constructed of 54 blocks. Each block removed is then balanced on top of the tower, creating a ...
btw my catch would be to make it real-time-ish. that is the time limit for each move would decrease every 10 vanished rows just as in real tetris... so even if there is an optimal algorithm it would still be a decent fastest-code challenge.
It is possible to build simple logic gates from dominoes. Hence, by combining these or otherwise, arbitrary binary functions can be computed with dominoes.
But of course, everyone who has played with dominoes (except Robin Paul Weijers) has experienced the disappointment when running out of them...
I'm seeing my infinite-growth-or-glider detection code tricked by the Penrose tiling. p2 * p5 * p7 * p19 isn't detected as an oscillator within 1000 gens.
@VisualMelon I guess you could always provide a link to a gist or pastebin and use your post for some explanation of the algorithm and a smaller and a larger example circuit.
Someone needs to post a multi-challenge riddle, leaving bits and pieces among many other challenges over a few months, and then posting the signpost that says "start here"
I Googled every single one of those celestial bodies, wrote down their initials, tried to figure out if their position in the tic tac toe board was relevant
Like if top left corresponded to the other top left
I really like those riddles because you have to have an "Oh, I see it." moment to progress
I think I got to the last level. Spent ages on it, and still not sure whether I got the right star but didn't use the format of the name which was expected, whether I messed up the maths, or whether Joe messed up the maths.
@PeterTaylor your numbers for p3 p4 p6 seem to match mine. I also find a lot of 5 and 7, enough so that I've had a few false positives for p35. Not stabilising in a grid with dead border is common enough, as well. If you get growth working, I'd love to see it!
@MartinBüttner I remember looking at their number, but after quickly seeing that they weren't adjacent I moved on. Maybe there is a non-adjacent pattern
@MartinBüttner my actual approach will be different from yours, if I get it working, but one other change you might make is getting your groups to walk with 1 or 2 spaces between them.
Once I'd suppressed those I got a lot of p11 and p19. Currently my "is interesting oscillation period" logic is: period > 7 && (period % 5 != 0 || period % 25 == 0) && (period % 7 != 0 || period % 49 == 0) && (period % 11 != 0 || period % 121 == 0) && period != 12 && (period % 19 != 0)
My idea to improve the BFS (and remove the randomness) would be to only search until a move uncovers new cells (which would also speed up the BFS a bit) and then when I select a move (where ties are broken based on number of cells uncovered), then I mark those as uncovered on the map before doing the BFS for the next group.
I've had a look at Sparr's wrapper... looks convenient enough for a Ruby submission. I'll see what I can do, but it might be tomorrow night rather than tonight.
Tetris Wars
In this KoTH, you will be playing Tetris with another player on a standard grid size. Completed lines will not be removed. A player gets a point by having more pieces than the other on a completed line. You win a game by having more points than your opponent.
You will play each o...
Suppose I write a code-golf question. How long should I wait before accepting the shortest answer? One week? Two days? More? I checked the FAQ, but couldn't find any information on this topic. Is there a general rule or is it just when the question asker feels like it?
Jenga code
I think everyone knows what Jenga is.
As per Wikipedia:
Jenga is a game of physical and mental skill [...] During the game, players take turns removing one block at a time from a tower constructed of 54 blocks. Each block removed is then balanced on top of the tower, creating a ...
