Author: chandler yergin
Date: 07:12:40 10/10/05
Go up one level in this thread
On October 10, 2005 at 10:04:42, Günther Simon wrote: >On October 10, 2005 at 08:28:05, chandler yergin wrote: > >>On October 10, 2005 at 03:25:21, Kurt Utzinger wrote: >> >>>On October 09, 2005 at 17:38:55, chandler yergin wrote: >>> >>>> Gentlemen: >>>>I should remind you that just a few years ago, it was well known that >>>>if White just played the Stonewall i.e. Pawns on Q4 e3 f4 against >>>>all the Top Programs on ICC it was fairly easy to crush Black on the Kingside. >>>>A frind of mine handle Chesscat.. now inactive, was just a 1900 USCF Rated >>>>Player, but boosted his ICC Rating to over 2400 doing exactly that.. and in >>>>Blitz! >>> >>> This may all be true. But fact is that Adam's >>> game has obviously not been played at time >>> control blitz 5' against Shredder 9.1 UCI >>> as many moves would never have been chosen >>> by this program. >>> Kurt >> >> Sorry Kurt, you don't know that! >> >>http://computer.howstuffworks.com/chess2.htm >> >>The Diagram is a simple 3 Level Tree >> >>Quoting: >>"The computer is playing as the white player. The black player has moved and >>left the board position at the top of the tree. In this tree, white can make >>three possible moves. From each of those three possible moves, black can make >>three possible moves. From each of those nine board positions, white can make >>two possible moves. (In real life, the total number of moves from any position >>is 20 or so, but that would be hard to draw.) "To decide what to do, the >>computer looks at this tree and works upward from the bottom. Its calculations >>are set up so that it finds the best board positions from each of the possible >>positions black will take (it takes the maximum): "Finally, it takes the maximum >>of the top three numbers: 7. That is the move the computer will make. Once black >>makes its move, the computer goes through this whole process again, generating a >>new tree and evaluating all of the board positions to figure out its next >>move."This approach is called the minimax algorithm because it alternates >>between the maximums and minimums as it moves up the tree." >>"The key thing to keep in mind, however, is that this is nothing like human >>thought. When we learn how human thinking works and create a computer that uses >>those techniques to play chess, we will really be onto something... " >> > >What has this all to do with faked games? > >>Give the young man some Credit! He played very well! >>The Computer plays as above.. >>Your comment sounds like 'sour grapes'. > >You have no idea what you are talking about obviously, Obviously you didn't read the Link; or understand how Computers play! >but if you don't care about facts just dream on... Present some 'facts' and I'll consider them. >(BTW the 'young man' is not what you think he is...) Then please tell us! If you can't or won't, then we have no interest in your comments or speculations! Simple? No? > >Guenther
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.