Hi all This is my first mail into the computer-go mailling list. So I want to contribute with a little teori of mine ! I call it "dobbelt move testing". If I should write a program that should check the importancy of a move, I would make a move follow by a move in the same color. The value of the first move is equal to the influence of the sum of all possible or good moves followed by the first move. Ex: ...........7 ...........6 ...........5 ....OX.....4 ....OX.....3 ...aOX.....2 ..aax......1 abcdefghijk This is the best example that I could setup for the moment. The value of the (black=X) e1 move is equal to the sum of the influence black making the moves VALUE_e1 = (e1 & d1) + (e1 & c1) + (e1 & d2) The program should now only make that first black move, and then test with 2 white moves to see have good the first black move is to resist any moves from white. Does any one understand my example ??? The dobbelt move should be make to test how important a sente move is. There could also be the possibility to test if the program should prevent a sente move (Gote) and test how important that move is !!! Regard Kjeld Petersen Denmark
Attachment:
Kjeld Petersen (E-mail).vcf
Description: Binary data