Re: Paper “Complexity of Go” b y Robson

Mario Xerxes Castelán Castro <[email protected]> Mon, 18 Jun 2018 13:42:56 -0500

Newsgroups	gmane.games.devel.go
Message-ID	<[email protected]>

Thanks you very much, Marcel. I will be reading your thesis. I am
interested in formalizing results about the game of Go as my next
project. I have have a repository of computer-verified proofs here:
https://puszcza.gnu.org.ua/projects/hol-proofs/ Right now I am still
finishing a formalization of algorithms for handling dates in the
Gregorian calendar (the ordinary calendar).

Regards.

On 18/06/18 13:23, Marcel Crasmaru wrote:
> Hi Mario,
> 
>>   J. M. Robson (1983) “The Complexity of Go”. Proceedings of the IFIP Congress 1983 p. 413-417.
> 
> If you are interested in how to prove that GO with kos and Japanese
> rules is EXP complete you can get an idea from my master thesis draft
> - I used Robson's idea with ladders instead of pipes (he had groups
> connected through long string of pieces, aka, "pipes")
> 
> If you have related questions I am happy to answer them.
> 
> Best,
> Marcel
>

_______________________________________________
Computer-go mailing list
[email protected]
http://computer-go.org/mailman/listinfo/computer-go

signature.asc (application/pgp-signature, 228 B)