Hello & thank in advance for any interests/ responses.
I'm unfortunately (or not) doing a dissertation as part of my final year
project (undergraduate) on the game of Go. The exact title is: "Can the game
of go be solved? Analysis of computational methodologies for go." And I have
included my over
Thank your for your response, Chris.
I think as Allis et al (1991, 1994) points out there is a difference in
'crackable' and 'solvable' where the former tend to be search-based
complexities and the later decision-based complexity. Irrespective of the
opponent via the cracking approach the best the
I just wanted to thank everyone - so far - for their responses/ help &
biblio's... even though some responses sling off topic... and also to add my
2-cent.
Although I am very new to the world of Go... and my understanding very
limited - I would like to believe that there are hidden solutions
[m
