[Problems to Attack] Re: On Game Space Size

[Mousheng Xu <moushengxu@xxxxxxxxxxxxxxxx>]

At 11:51 PM 5/6/99 +0200, Robert Jasiek wrote:
>They are fun on their own, at least for the amateurish mathematicians
>among us:)

Dear Robert and all the others,

	There is a lot of fun & useful problems to hack for go programming. Here
is my list:

	1. What is sufficient for a group of stones to live? Two formed eyes or
co-survive. What else? Maybe I should say "what is sufficient for a group
with no eyes to form two eyes?"
	2. What is necessary for a group of stones to live? Guaranteed to have
more than 1 liberty. For simplicity, if we only consider the two eye case,
what is necessary for a group of stones with no eyes to form two eyes?
	We are talking about sufficiency & necessity here.
	3. How to calculate the strength of connection between two groups?
	4. How to tell if a pattern is boarder sensitive? Or in other words, when
should we consider the boarders when a pattern is concerned?
	5. ...

	I'd be overjoyed to know any theorems, corollaries, & lemmas for the above
problems.

	Thanks.

-- Mousheng Xu