![]() StartingPoints Sub-pages Homepages
|
KGS Go Cafe
PageType: HomePage Keywords: Online Go, Clubs & Places
The KGS Go CafeNOTES:Blitz King Title Games
- Join the Go Cafe Teaching Ladder- Looking for suggestions of possible events that can be held at the Go Cafe. If you have any suggestions please post them here or message the director or coodirector.- We recommend that players should leave our room open so that they may be informed of events more efficiently.This room can be found under Social Rooms in the KGS Room List. Our purpose for creating this room is so that players have a place where they can meet other players, talk about Go, teach people, and compete.
Goto Director: firefox04 (founder)
Court Jester: Uvas
Positions OpenThe Cafe is looking for dedicated staff members. If interested please message me at firefox04, Highwind, or Brave. Co-Directors (Only 2): Brave (aka Highwind)
Events Organizer: AkitoKun?
Events Coordinators: ChibiLi?, Elements14?, AkitoKun?
Tournaments Organizer:
Tournament Coordinators: Ryujii
Recruiters:
Mentoring Organizer:
SL Page Managers:
Message BoardEvents:
Message firefox04 if interested. Affiliations:Quick Suggestions:Problem of the Month (of September)
IF no solution is offered by the end of the month the answer will be revealed at the end of the month or at the beginning of the next. Solutions: (enter solutions under here in Black, White, Black,... order): reptar: My attempt:
Comments on Problem: KGS Special Problemwms: I have a problem, but I won't put it as problem of the month because it is not a "typical" go problem. Lately in rec.games.go a discussion has sprouted up and KGS' implementation of Japanese rules. That jogged my memory about something I thought about a while back, but was never able to prove one way or the other. It occurred to me that it might make a nice problem for people interested in go oddities. The problem comes from KGS' seki detection code. The goal of the KGS seki detection code is to always correctly spot seki, as long as both a) all dame that can be filled, are filled, and b) all dead stones are marked correctly. But I thought of one situation that would make the KGS algorithm have an error. I think it is not possible for such a situation to exist, but I'll put it here, and invite people to try to find such a situation, or prove that it cannot exist: Can you find a position where one player (black, let's say) has two one-eyed seki groups separated by a bamboo joint (or similar connected-by-dame-but-can't-connect shape) of white's. If black tries to push through the bamboo joint, black will die, but if white tries to fill one of the "gap" dame in the bamboo joint, then white will suffer some problem (either dying or allowing one or more black seki groups to become fully alive). If anybody can find such a board position, then it will be interesting, and I will have to adjust my seki algorithm. If somebody can prove it can't exist, then that's great, my algorithm is fine. If you want to know more about the algorithm itself, just use google to search rec.games.go for the terms "shubert" and "seki".
rubilia: wms: OK, te help things along, here is an example position that is close but not quite there:
This looks like what I need, but note that if black plays first, then black can connect, make life, and kill white by pushing through the bamboo joint; if white moves first, white can just fill the bamboo joint and end up killing both black groups. So this isn't even a seki at all, but it shows what I need - two one-eyed groups, separated by dame. I need a position like this, but where neither player can fill the dame separating the two one-eyed groups. Or, just as good, I need proof that in such a situation, one player will always be able to fill the dame.
impu1se: I think something like the second example under number 4 in StrangeSekis is what you're looking for. wms: No, #4 in strange sekis doesn't match - the two one-eyed groups are opponsing colors, so "connecting" them won't give a living group. Like this? Neither can attempt to make a move inside the bamboo
wms: The example above doesn't work, KGS/CGoban scores it perfectly - there is only a single one-eyed group. Again, look at my example above, the key thing is two one-eyed groups of the same color, connected by dame that neither player can fill. You say that it's clearly impossible, but I don't see that; my point is that filling the dame must be impossible. Don't forget, when you fill dame, you also under certain circumstances reduce your liberties - so there are cases where dame simply cannot be filled safely. Teaching Ladder/Mentoring ProgramTeaching Ladder/Mentoring Program TournamentsTitle GamesEventsComments"Problem of the Month" Archive"Problem of the Month" Archive Supplementary Go ProblemsThis is a copy of the living page "KGS Go Cafe" at Sensei's Library. ![]() |