I assumed the rules were symmetric, in that black also had to place his stones
within distance k to white's last move.
steve uurtamo wrote:
for small k, this should give a massive advantage to black.
the additional requirement that white place a stone within the
smallest cityblock distance of
for small k, this should give a massive advantage to black.
the additional requirement that white place a stone within the
smallest cityblock distance of the last stone whenever he has
no valid move within distance k of black's last move is an even more
substantial advantage for black. i'm thinki
On Tue, 2008-11-18 at 17:31 -0500, Michael Williams wrote:
> Well, "vastly" when k is small.
>
> The only way to find a good Komi would be testing and guesstimating.
>
> I think MCTS would be well suited to this variant because you still have the
> problem of difficulty in finding a good evaluat
Well, "vastly" when k is small.
The only way to find a good Komi would be testing and guesstimating.
I think MCTS would be well suited to this variant because you still have the
problem of difficulty in finding a good evaluation function and MCTS solves
that.
Computers would probably be stron
I think a computer would play this variant well if k was small.
To make the move generation consistent, the first move should be played
as if there was a previous move to the center perhaps.
Ladders would probably still be an issue.
- Don
On Tue, 2008-11-18 at 23:20 +0100, "Ingo Althöfer"
I think computers would be much better at this game (than they are at Go)
because you have vastly reduced the branching factor of the game.
Ingo Althöfer wrote:
Hello,
one of the basic problems of go newbies
is their tendency to place the next stone
near to the latest stone of the opponent.
Hello,
one of the basic problems of go newbies
is their tendency to place the next stone
near to the latest stone of the opponent.
Sometimes this is called the "2-inch heuristic
of beginners".
What do you think about a formalized variant
of Go with one-sided distance-k rule?
> Let k be some nat
