Author: Robert Hyatt
Date: 19:57:11 08/18/02
Go up one level in this thread
On August 18, 2002 at 10:43:25, Vincent Diepeveen wrote: >On August 18, 2002 at 01:46:37, Engin Üstün wrote: > >If i understand well you don't seem to see the problem. > >If a computer is just selecting 5 moves to search it will >be 1500 rated at most. *at most*. > >Usually because the 1500 opponents forfeit or something. > >if you want to make a program that is as smart as a human, >without searching as much as they do now, >then you have a major problem, because you then you could also >make a human from silicon, which is impossible. > Proof (or citations) for that last statemennt??? I think that "impossible" should be removed from your vocabulary. You use it too much, and generally incorrectly... >Computerchips use true or false assumptions. Making human intelligence >out of that is impossible. Even making software that is approaching that >is impossible, because the software needs a true or false logic what >to do in the 3d case :) > Again, a proof or citation to prove that? Are you _sure_ that you don't ultimately revert to 0/1 calculations? Nobody _else_ is sure yet... >>On August 17, 2002 at 23:07:08, Vincent Diepeveen wrote: >> >>>On August 17, 2002 at 15:02:45, Engin Üstün wrote: >>> >>>using 1-5 moves a position and ignoring the >>>rest will give a 1500 rated engine because you might miss >>>that mate in 1, or miss you lose a piece in 2 ply. >>> >>>Is that what you want? >> >>do you really believe that a GM calculate thausends and millions of positions to >>find the best move ? >> >>do really believe that GM is stronger then amateur while he search faster ? >> >>i don't believe it! >> >> >>> >>>>i sad the most of programs today not all. >>>>sorry but i want not discuss wich programs are fast or used bitboards. >>>> >>>>i meaned is not exist other ways to write a strong engine using selective >>>>methods. >>>>i mean not null move or extensions. >>>>to try 1-5 moves per position not more and reduce the nodes and search tree >>>>extremently. >>>>problem is what 1-5 moves are there to try search. >>>>i know that is a old idea, but i see nobody of programers are to try this way. >>>> >>>>programs been faster and faster, is that the only one way?
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.