[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [computer-go] citation
Waldviertel-Hochland, 14.07.2004
>
>The complexity of Go isn't that much related with branching factor in
>my opinion. If Chess was played on a much bigger board and with more
>pieces, it would still play strong relative to humans.
>
I am playing currently with the inventor of a 3D-chess correspondece games.
The branching factor of this 3D-chess is higher than Go. The inventor
thinks, that programs would be inferior due to the branching factor. But I
am sure it is exactly the contrary. Even a very simple program would easily
beat humans. A 5 ply search is in 3D-chess already deadly. It is an extremly
tactical game with very surprising check-threats (it is therefore in my
opionion more fun than normal chess, because the tactical infight starts at
the 1st move).
There are also of course no real strong human 3D-chess players. But after a
relative short time playing Go I have good chances against Go-programms,
whereas I would have absolut no chance against a 3D-chess-programm.
Best Regards
Chrilly
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/