Re: [Computer-go] implementing simple ko
You can have multiple kos on the board. Two is the most usual case that doesn't trigger other rules. Easiest (logically, not practically, perhaps) is to never repeat a board position ever (so called superko, I think), which could be implemented as a full-board-position hash. s. On Mar 11, 2015 10:08 PM, Ray Tayek rta...@ca.rr.com wrote: i need to implement a simple ko rule. looks like you need to keep track of 2 points for each ko and who took it last. so it looks like a list of (point,point,who) that can change each turn? any pointers will be appreciated. thanks -- Honesty is a very expensive gift. So, don't expect it from cheap people - Warren Buffet http://tayek.com/ ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
Re: [Computer-go] implementing simple ko
On 3/12/2015 9:49 AM, Hiroshi Yamashita wrote: ... i need to implement a simple ko rule. I wrote simple pure-MC and UCT sample. http://www.yss-aya.com/puremc20150313e.zip put() function handles a simple ko. got it. thanks -- Honesty is a very expensive gift. So, don't expect it from cheap people - Warren Buffet http://tayek.com/ ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
Re: [Computer-go] implementing simple ko
On 3/12/2015 6:16 AM, Robert Jasiek wrote: On 12.03.2015 06:07, Ray Tayek wrote: i need to implement a simple ko rule. Supposing you want a strategically simple AND complete ko ruleset, you can choose from: 1) short cycle loss (2 or 3 successive plays, see below) + long cycle tie ko rule 2) basic ko rule + fixed ko rule (recreating a same position is allowed but then a different play must be made) If you do not search for a complete ko ruleset but for a practically easily implemented and feasible: 3) basic ko rule + 3-play-loss (for the player playing to recreate the position) Note that none of these are used by go servers or in the real world. ... nice summary. thanks -- Honesty is a very expensive gift. So, don't expect it from cheap people - Warren Buffet http://tayek.com/ ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
Re: [Computer-go] implementing simple ko
You only need to keep track of one point. If the last move was a single stone capture, then that point is the Ko point for the next move. A play by the opponent on that point is disallowed unless it's a capturing move. Urban On Thu, Mar 12, 2015 at 6:07 AM, Ray Tayek rta...@ca.rr.com wrote: i need to implement a simple ko rule. looks like you need to keep track of 2 points for each ko and who took it last. so it looks like a list of (point,point,who) that can change each turn? any pointers will be appreciated. thanks -- Honesty is a very expensive gift. So, don't expect it from cheap people - Warren Buffet http://tayek.com/ ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go -- Blog: http://bettong.net/ Twitter: https://twitter.com/ujh Homepage: http://www.urbanhafner.com/ ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
[Computer-go] implementing simple ko
i need to implement a simple ko rule. looks like you need to keep track of 2 points for each ko and who took it last. so it looks like a list of (point,point,who) that can change each turn? any pointers will be appreciated. thanks -- Honesty is a very expensive gift. So, don't expect it from cheap people - Warren Buffet http://tayek.com/ ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
