The attached position shows the "Kirtag Problem". I have named it after the Austrian proverb "Man kann nur auf einem Kirtag tanzen" (One can dance only on one village-party***). More mathematically it is the subgame problem. White to move, what is the status of the white marked stones. Treated locally, each stone can be easily saved, but alas, one can dance only on one party.

*** I have looked in online-dictionaries for the correct translation of "Kirtag". I have not found an entry, because the dictionaries are made by German institutions. Kirtag is a typical Austrian word and the Germans do not know it. Every village has traditionally once in a year a feast. Usually its on the day of the village-patron/saint. If two nearby villages have e.g. St.George as patron, the Kirtag is on the same day and one gets the problem which Kirtag one should attend. Usually the Kirtag with the more interesting girls/boys. But this depends also on their choice. In modern times the disco has replaced the Kirtag. One should probably rename it the "disco-problem". Modern kids try to solve the dicso-problem by driving with the car from one disco to the next. They spent now most of the time driving around and not with dancing. This is also a fundamental computer-go problem. The programm can not decide where to dance and spends its tempo by jumping around from one subgame to the next.

Chrilly

Attachment: KirtagProblem.sgf
Description: Binary data

_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Reply via email to