[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[pbmserv] Yavalath puzzle
- To: pbmserv-users@gamerz.net
- Subject: [pbmserv] Yavalath puzzle
- From: Cameron Browne <cameron.browne@btinternet.com>
- Date: Mon, 25 Aug 2008 09:07:22 +0100
- Domainkey-signature: a=rsa-sha1; q=dns; c=nofws; s=s1024; d=btinternet.com; h=Received:X-YMail-OSG:X-Yahoo-Newman-Property:Message-Id:X-Mailer:Date:To:From:Subject:In-Reply-To:References:Mime-Version:Content-Type; b=cRGQEZ6FMV8ZyTsnD7hWhU0uhFzaXl0kdFjM1kRlz7bVh3rHHpQGi3rFywnEL+NNDrPmRtP2USJqe97B+UfziwAVhZjV1m6IbrAQkEpdeuz56XXYDvzafGa63xXjNU5cCNKB3RnVaSGuiMRqXmZ1tWOQYJiYu9k2Nq4mrzxDmQI= ;
- In-reply-to: <7.0.1.0.1.20080825084125.036be870@btinternet.com>
- References: <200808240953.m7O9rpA1024220@play.gamerz.net><7.0.1.0.1.20080825084125.036be870@btinternet.com>
- Sender: owner-pbmserv-users@gamerz.net
Hi,
Here is a Yavalath puzzle: X to play and win.
1 2 3 4 5
/ / / / / 6
/ 7
a- x . . . x / 8
b- . . . x o . / 9
c- . o . o . . . /
d- . . . x . . . .
e- . o . . o . x . .
f- . . o . x . . .
g- . x x . . . .
h- . o . . o x
i- . o . . o
This puzzle is based on a game played with wghunter. I believe that X
has exactly one winning move and that all other moves lose quickly
(assuming that O plays optimally).
Can anyone prove or disprove this?
Cameron
PS. The rules of Yavalath are as follows:
- Players take turns adding a piece of their colour to an empty cell.
- Win by making 4-in-a-row of your colour.
- Lose by making 3-in-a-row of your colour without also making 4-in-a-row.
http://www.cameronius.com/games/yavalath/