Author: Dann Corbit
Date: 12:39:20 12/12/02
Go up one level in this thread
On December 12, 2002 at 13:45:51, Bernardo Wesler wrote:
>I am proud of having opened this important discussion matter in this forum, but
>you know what? Nobody answered in concrete my questions...... Almost everybody
>went to branches.......and forgot the primitive "tree"..... or better yet, they
>forgot the forest dealing with a tree.....
>Maybe it sounds romantic, but it is true.
>I did put on the table simple and concrete questions, and nobody answered me in
>that way..... We appear , several times in our lifes, as kafkian people, trying
>to explain simple matters with million of words...... no way: see the example of
>Einstein; his geniality becomes from having had the wisdom of trapping the
>relativity theory in a very, very, SIMPLE formula...... That's it. Period.
>He also said that Information cannot replace knowledge , not even knowledge
>cannot replace wisdom......
>The most important things in our lifes are so simple......as far as you cannot
>explain with words what true love or true friendship means......
>Anyway, I wish to thank everybody ..... I always learn a lot from you, guys.
>Thanks.
>Dr Wesler, M.B.A.
>blwesler@mail.retina.ar
This algorithm will formally solve the game of chess:
MiniMax Algorithm
function MINIMAX(N) is
begin
if N is a leaf then
return the estimated score of this leaf
else
Let N1, N2, .., Nm be the successors of N;
if N is a Min node then
return min{MINIMAX(N1), .., MINIMAX(Nm)}
else
return max{MINIMAX(N1), .., MINIMAX(Nm)}
end MINIMAX;
Two-Player, Perfect-Information, Zero-Sum Game
It just takes a while.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.