Parece que no es ninguna novedad (la resolución data de 2003,
http://www.cs.unimaas.nl/~vanderwerf/5x5/5x5solved.html) pero yo no me había
enterado. "Battle go" es el resultado de una poco feliz cadena de traducciones;
se trata del "atari-go" o "come-come".

Eduardo

=============================
http://www.nwo.nl/nwohome.nsf/pages/NWOP_68HC62_Eng

Computer cracks Go game
11 January 2005
A computer program that can solve the Go game for a 5x5 playing board. Dutch
researcher Erik van der Werf achieved a world first with this program. A
complete Go playing board has 19x19 rows. Van der Werf investigated new
computing techniques to improve the Go programs with the ultimate aim of
beating the best human players.

Not only has Van der Werf solved the Go game on a playing board of 5x5 rows,
but also Battle Go (a simplified version of Go) for boards of up to 6x6
rows. With their last program MAGOG, Van der Werf and his colleagues won the
bronze medal at the 9x9 Go tournament, held at the ninth Computer Olympiad
in Israel last summer.

Technique

Van der Werf's research focused on searching and learning techniques for
games programs. Searching techniques are used in chess programs to think
several moves ahead. This allows the tactical complications in positions to
be better assessed. A search program that is efficient enough to think so
far ahead that it achieves end positions can, in principle, play perfectly.
The MIGOS program used to solve the Go game on a 5x5 playing board, is based
on searching techniques.

However, searching techniques alone are not enough to play Go well on larger
playing boards. Then the program cannot always search deep enough to achieve
end positions. Therefore, Van der Werf also investigated learning
techniques, which are used in games such as backgammon or other complex
applications such as image recognition. The computer uses learning
techniques to learn from human demonstration games which the Go program
analyses. Van der Werf used learning techniques to predict strong positions,
predict life and death and to estimate potential territory.

Tactics

Go is a board game from Eastern Asia for two players. Each tries to surround
a territory with stones of their colour. A player can strike the stones of
his opponent by surrounding these with his own stones. The player with the
most territory wins the game. According to legend, the game was first played
in 2300 BC by a Chinese emperor who wanted to teach his son tactics,
strategy and concentration.

In 1997, the chess computer Deep Blue beat the world chess champion
Kasparov. Yet almost eight years later, a Go program that can beat a good
amateur has yet to be developed. In the mid-1980s the Taiwanese industrial
mogul Mr Ing put up $1 million for the maker of the first Go program capable
of beating a professional player. The prize money expired in 2000 with the
death of Mr Ing, but the challenge has yet to be met.

The research was funded by the Netherlands Organisation for Scientific
Research.
=============================