toroidalet wrote:(Also, isn't it that you lose if you have to make a tree that (homeomorphically) contains another, rather than winning?)
toroidalet wrote:{}
A bold first move; how will his/her opponent react?
x = 12, y = 12, rule = AnimatedPixelArt
4.P.qREqWE$4.2tL3vSvX$4.qREqREqREP$4.vS4vXvS2tQ$2.qWE2.qREqWEK$2.2vX
2.vXvSvXvStQtL$qWE2.qWE2.P.K$2vX2.2vX2.tQ2tLtQ$qWE4.qWE$2vX4.2vX$2.qW
EqWE$2.4vX!
PkmnQ wrote:Hmm, only 2 players are allowed for the game, so I'll have to do something in TREEgame(4).
Moosey: <>
PkmnQ: [{}]
I think I'm playing it a little bit too safe here. What are legal moves?
x = 12, y = 12, rule = AnimatedPixelArt
4.P.qREqWE$4.2tL3vSvX$4.qREqREqREP$4.vS4vXvS2tQ$2.qWE2.qREqWEK$2.2vX
2.vXvSvXvStQtL$qWE2.qWE2.P.K$2vX2.2vX2.tQ2tLtQ$qWE4.qWE$2vX4.2vX$2.qW
EqWE$2.4vX!
fluffykitty wrote:I believe Moosey's second move is illegal because you can contract the () node to get PkmnQ's move.
fluffykitty wrote:Also, while we're waiting for the players to play, how about people try to make long TREE(3) sequences? I'll submit {},(),[],empty to get things started.
{}
([])
[[][]]
[[[[]]]]
[[[(())]]]
[[[()()()]]]
[[[()()](())]]
[[[()()]()()()]]
[[[()()]()()](())]
[[[()()]()()]()()()]
[[[()()]()()]()()]
[[[()()]()()]()]
[[[()()]()]((((((()))))))]
x = 12, y = 12, rule = AnimatedPixelArt
4.P.qREqWE$4.2tL3vSvX$4.qREqREqREP$4.vS4vXvS2tQ$2.qWE2.qREqWEK$2.2vX
2.vXvSvXvStQtL$qWE2.qWE2.P.K$2vX2.2vX2.tQ2tLtQ$qWE4.qWE$2vX4.2vX$2.qW
EqWE$2.4vX!
x = 7, y = 5, rule = B3/S2-i3-y4i
4b3o$6bo$o3b3o$2o$bo!
fluffykitty wrote:If you're deviating from the blog post's rules, you need to specify exactly what the rules are.
Also, while we're waiting for the players to play, how about people try to make long TREE(3) sequences? I'll submit {},(),[],empty to get things started.
hdjen wrote:New game, anyone?
[]
{},
([]), and now
[[()]]
toroidalet wrote:A continuation of the TREE(3) game:Code: Select all{},
([]), and now
[[()]]
Moosey wrote:
What rules apply to this one?
Presumably no “Moosey instantly wins”
({})
x = 7, y = 5, rule = B3/S2-i3-y4i
4b3o$6bo$o3b3o$2o$bo!
ishanpm wrote:Shouldn't the player with no legal moves be the loser? That's how it is in the original article, anyway. Otherwise, there are only a few ways the game can play out. For TREE(3), there's a fairly simple winning (losing?) strategy for P1:
P1 plays (). P2 then has a choice:
- []: P1 plays {{}}, P2 must play {}, P1 wins.
- [[]]: P1 plays {}, P2 must play [], P1 wins.
- {}: P1 plays [[]], P2 must play [], P1 wins.
- {{}}: P1 plays [], P2 must play {}, P1 wins.
- [{}]: P1 should then play {[]}. P2 will have to play repeating {{...}} or [[...]] (up to 4 deep), P1 should respond with the same number of [[...]] or <<...>>. If P2 plays [[]], {{}}, [], or {}, P1 should respond as above.
I'll write a small Javascript applet that can validate TREE(k) games, to make analyzing these a little easier.
ishanpm wrote:Tree game validator! Let me know if you see any bugs.
Doesn't support fakeTREE at the moment. Later, I'll add a feature to list legal moves.
https://jsfiddle.net/ishanpm/s45w7ouj/
Users browsing this forum: PHPBB12345, testitemqlstudop and 5 guests