| Author |
Message |
Yuenwai Cheu (Pushconnec)
New member
Username: Pushconnec
Post Number: 1
Registered: 11-2014
| | Posted on Friday, November 28, 2014 - 9:34 pm: | |
My aim is as following: there are a fixed number of (8-16) pieces on a big chess board for each player to move by certain rules. The winning condition is that all of them are connected to each other (only vertically and horizontally), forming a single connected area.
Is there any similar game in existence (I suppose Go should have implemented something like this)? I am wondering whether it is hard or inefficient for ZoG to check this in both game rules and AI playing. If it is inevitable, I may not throw in too much time in it. |
Yuenwai Cheu (Pushconnec)
New member
Username: Pushconnec
Post Number: 2
Registered: 11-2014
| | Posted on Friday, November 28, 2014 - 9:37 pm: | |
And I would want to extend it in some variants, like pieces could be added or taken away, only need a connection of a certain portion of pieces (say 7 out of 8), need a connection contain certain king of pieces, etc. For sure, it all depends whether the simplest case could be implemented. |
Larry Wheeler (Brainburner)
New member
Username: Brainburner
Post Number: 3
Registered: 3-2007
| | Posted on Friday, November 28, 2014 - 11:32 pm: | |
See Claude Soucie's game Lines of Action. I haven't looked at the code, so I don't know how difficult it is to do, but it's obviously possible. |
Yuenwai Cheu (Pushconnec)
New member
Username: Pushconnec
Post Number: 3
Registered: 11-2014
| | Posted on Saturday, November 29, 2014 - 4:19 am: | |
Thanks for the quick reply. I would check that code. |