[ List Earliest Comments Only For Pages | Games | Rated Pages | Rated Games | Subjects of Discussion ]
Comments/Ratings for a Single Item
A problem for the real mathematician about DVONN: How high can a stack maximally grow in the game when: a. The stack contains one or more DVONN-pieces (so it will survive by definition) b. The stack contains no DVONN-pieces bi. The stack dies later in the game by becomming disconnected bii. The stack gets a DVONN-piece later in the game (and thus survives) biii. The stack survives without getting a DVONN-piece Some one-dimensional examples. Assume these lines as isolated islands: A number is a stack without DVONN-piece, X is a high, immobile stack without DVONN-piece, D is a single DVONN-piece. bi: X - 1 - D. The singleton has to move and stack X dies. It can only become X+1 upon dying. The X+1-stack never really lived. bii: X - 1 - D - 1. The stack can only be saved by using the rightmost singleton to put the DVONN-piece on the stack and it can grow to X+3 with a DVONN-piece, but had highest size X without DVONN-piece. biii: X - 2 - D. The stack stays connected and survives. Note that White and Black play together to get the high stack. But the rules must be obeyed. The problem can be simplified by disregarding one or movre rules. Could there be a systematic way to solve this problem. This is not for making a ZRF. I already made an ugly ZRF in which I used 25 as maximum, becuase when higher stacks are brought back to 25, the same moves are possible and the outcome (win/loss/draw) will always be the same. Only the point difference can be different.
Joost, You have made a difficult question. Not answer yet. Are you trying a zrf?. It does not look a hard job, stacked pieces are, each one, a piece with a particular movement, the difficult task is that Zillions can play it decently, I have my doubts. There are not many free (or not) DVONN programs around, I have found only one, in French. Follow the link: http://www.nivozero.com/
I don't know. But I got my ass kicked by Zillions several times. But I don't know any DVONN tactics, so probably it is just a sign that I'm still not good at it. My ZRF is built with the idea that the only things that matter for a stack are its size, its owner and whether or not a DVONN-piece is in there. I didn't bother about stacks larger than 25 (because they and larger stacks are equally immobile and equally winning when surviving). Rules like the 'No move with enclosed pieces' are trivial to implement. After each move, an administrator (?-player) must remove all disconnected pieces. I used a pass-detector that detects when players pass. Then I create dummy pieces to make high stacks count for that many pieces and then carefully trigger the count-condition. But I think that the maximum height of a stack is more than 25. Take the leftmost positions as building position. Then try to get stacks with heights 1, 2, 3, 4, etc. on positions on the center row. From four other positions, stacks can directly be moved to the target. Still, I don't think the answer is 49 (or 46 for a DVONN-less stack), but probably they are close.
4 comments displayed
Permalink to the exact comments currently displayed.