If anyone is familiar with the board game Go, and simply mathematically gifted to genius level, then can you devise a way to make Go a board game, allowing a 19x19 or 25x25 board? The location limit is like 255. If you look at my map you'll see what my idea is, to have locations detect the adjacent stones, and somehow work a trigger system that will detect the largest chain possible, which is probably 624 on a 25x25 board.

Attachments:

I wouldn't use locations for each section, I would use a static grid of burrowed units instead, otherwise the location limit is a major issue, and while you're already doing that for some of it, you still have way more locations than necessary(the a1-i9 locations) being used. I would recommend looking into ProTRG or MacroTriggers for this map, since making this many combinations of triggers will be awful to do by hand.

Also, if you want help from people, explaining the game might be the best way to achieve that, instead of just hoping they know it.

Post has been edited 1 time(s), last time on Jan 23 2010, 5:27 am by Falkoner.

Thanks, those programs look very helpful. Here's a quick rundown of the game Go: http://www.gokgs.com/tutorial/

I don't know how many pieces each person gets, the Go piece could be calculated by minerals or gas, but each person will place down a Go piece (chip) per turn with a limited amount of time. The object of the game is to have the most territory by the end ( once all pieces are used, I believe . Territory is decided by area of the chips, more chips connected together, the more area.

Capturing someone else chip
O = White
B = Black
- = unused spot

- O -
OBO
- O -
If surrounded like that, the black player will lose their piece and it will be removed and white should get a point.
I believe this is a decent summary of how the game works.