A last esthetic suggestion: let's mark the lower group and label with
1 the last move Black did in the ko:
https://drive.google.com/file/d/1L62m7i_IJX8FCB_8rIOwjYK3tR1GZZaq/view?usp=sharing
On 23 June 2018 at 00:19, Marcel Crasmaru wrote:
> Well all my reasoning was good but for the form
side ko).
--Marcel
On 23 June 2018 at 00:06, Marcel Crasmaru wrote:
> OK I think there is one thing to be done to make the solution longer:
>
> 1. mark the middle ko and then
> 2. problem should be: B just captured in the middle ko and W is to
> move - is the group alive?
at y (x = 0, y = 1, z = 1, F true),
B takes at z (x = 0, y = 1, z = 0, F false) and W is dead as no matter
what W does F remains false (equivalent to ladders failing for W).
--Marcel
On 22 June 2018 at 22:27, Marcel Crasmaru wrote:
> Errata: assuming x is the top ko then the form
Errata: assuming x is the top ko then the formula encoded by this problem is
z && (y || x)
with x = 1, y = 0, z = 0 and W cannot play at z. Thus W is already
dead you cannot make the formula true.
--Marcel
On 22 June 2018 at 22:19, Marcel Crasmaru wrote:
> The position looks OK is
The position looks OK is great - I didn't find any side solutions.
Just one observation: I think this encodes x && y || y || z and W is
dead already thus is arguably a easier problem :)
Should make for a great wall poster.
On 22 June 2018 at 19:48, John Tromp wrote:
> at the bottom of my
GO.)
Thanks,
Marcel
On 19 June 2018 at 13:10, uurtamo wrote:
> _first capture_, no?
>
> s.
>
> On Mon, Jun 18, 2018, 6:59 PM Marcel Crasmaru wrote:
>>
>> I've eventually managed to create a problem that should show a full
>> reduction from a Robson proble
adders and makes the group alive.
Now the question is how hard is to program a tsumego solver for this
(kind of) problem.
Cheers,
Marcel
On 19 June 2018 at 11:35, John Tromp wrote:
> On Tue, Jun 19, 2018 at 12:03 PM, Marcel Crasmaru wrote:
>>> White can start one ladder as a ko t
wrote:
> On Tue, Jun 19, 2018 at 3:52 AM, Marcel Crasmaru wrote:
>> I've eventually managed to create a problem that should show a full
>> reduction from a Robson problem to Go - I hope is correct.
>>
>> The Problem:
>> https://drive.google.com/file/d/1tmClDIs-ba
I've eventually managed to create a problem that should show a full
reduction from a Robson problem to Go - I hope is correct.
The Problem:
https://drive.google.com/file/d/1tmClDIs-baXUqRC7fQ2iKzMRXoQuGmz2/view?usp=sharing
Black just captured in the marked ko. How should White play to save
the
apture any stone then I believe you actually
prove that first-capture go is PSPACE complete.
--Marcel
On 18 June 2018 at 20:17, Marcel Crasmaru wrote:
> You can also find here one of my attempts to create a difficult Robson
> like problem on a Go board but I guess I've run into
ed 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:
>> H
Also - a downloadable link:
https://drive.google.com/file/d/1tLCYr74UwVQsXAE2QrcwrGALIduH34b8/view?usp=sharing
--Marcel
On 18 June 2018 at 19:35, Andries E. Brouwer wrote:
> On Mon, Jun 18, 2018 at 11:54:51AM -0500, Mario Xerxes Castelán Castro wrote:
>> Hello. I am asking for help finding
Errata: > reduction from GO to an EXP hard problem
should be the other way around :)
--Marcel
On 18 June 2018 at 19:36, Marcel Crasmaru wrote:
>> J. M. Robson (1983) “The Complexity of Go”. Proceedings of the IFIP
>> Congress 1983 p. 413-417.
>
> If you are inter
13 matches
Mail list logo
