Just tried a size 12 game against Corner Hugger and it was cute seeing it get easily pushed back until I realised it had started building from another corner off screen and swept back to decimate me. More interesting dynamics than I'd expected :)
The leaderboard snippet could use some improvements.
Improvements usually fall into three categories:
Formatting & CSS - make it look better
Functionality - stuff it should do
Misc - everything else
Please answer with suggestions. I've added a few myself.
@trichoplax I was wondering too. I thought at first that under perfect play the first player wins but the more I play it the more I realize that it's not nearly that simple...
@trichoplax There were 138 counters at the end of the game, and each move by either player adds exactly one counter (they're just redistributed). Thus, there were 138/2 = 69 turns.
@El'endiaStarman since the algorithms are fully deterministic, I've pitted two corner huggers against each other. Blue wins for 3, 5; red wins for 4, 6. I conjecture that blue wins for odd-length boards, and red for even length boards.
@El'endiaStarman I just won with 213 on size 6 as player 1. Shouldn't the score be even? Also, I went down to just one remaining corner hexagon, and playing there took out the entire board, which I really wasn't expecting, so I wonder if it was a bug.
@ConorO'Brien (cc @quartata) Basically, steal their corners. When they're building up a corner, build up on a different, unoccupied corner. Once their corner explodes, put a single counter there. When they try to build up an edge hex, build up the adjacent corner and capture it. Continue until all opponent counters have been converted.
Would it be interesting to have a KotH where the board is a randomly generated shape each time (a random connected hex grid) to prevent tailored approaches?
You could just randomly place hexagons until they are all connected and above a minimum number of cells
CMC: Given a positive integer N, output the maximum number of moves possible on a hexplode board of size N. The first 4 terms are 0, 17, 65, 143, which is dissappointingly not on OEIS
The chess tag wiki currently states, "This tag is for challenges related to chess or any derivative of it." This wording technically excludes games like Xiangqi (aka "Chinese chess"), which are part of the same family but aren't derivatives (more like cousins). If we're going to include fairy che...
Tetrahedron countdown
Write a function f(n,k) that displays the k-dimensional countdown from n.
A 1-dimensional countdown from 5 looks like
54321
A 2-dimensional countdown from 5 looks like
54321
4321
321
21
1
Finally, a 3-dimensional countdown from 5 looks like
54321
4321
321
...
Hexplode is a computer board game originally designed for the BBC Micro but since ported to many other platforms. The board comprises an array of 25 hexagonal cells. Its novel feature for a two-player alternate-turns game is that when the number of tokens in each cell reaches a critical threshold, the cell "hexplodes" such that the contents of the cell are equally distributed to each of the adjacent cells. This process can often generate a chain reaction which means that predicting the outcome of a turn is quite difficult for human players.
== History ==
The game first appeared in the Bri...
@ASCII-only Actually, I think it's impossible for a board with size 2. Because the tiles are 2, 2, 2, 2, 2, 2, 5 and you need a group of 3 and a group of 4 to some 7 and 8 (or 8 and 7)
A size 4 Hexplode board has 6 corners (2), 12 edges (3), and 19 centers (5). It definitely seems like there should be some way to finagle these so that the sums are one apart.
Hey wait, can't you use the same filling strategy?