Author: walt irvin
Date: 06:19:08 03/05/06
Go up one level in this thread
On March 04, 2006 at 11:52:07, Charles Roberson wrote: >On March 04, 2006 at 10:52:52, walt irvin wrote: > >>On March 04, 2006 at 09:56:10, Charles Roberson wrote: >> >>> > >> >>that may be true but im sure that 50,000 or 60,000 games is not that hard to >>do,,,,besides if u used a strong program instead of that random one i talked >>about you could store positions up until say the score of + or - 3.5 should also >>eliminate alot of positions,,,,, > > Maybe its more effort than you think. > First you want the best play possible which implies long time controls. > I guess that is 1.5 hours per side to play the whole game which averages > to 1.5 minutes per move. > Well that would be 180,000 hours for 60,000 games. > That is 20.5 years. > > That looks like a long time, so what about dropping the quality of the > search. Lets drop the time per move to 9 seconds. That's a 10x drop. > So, you are still at 2.5 years to complete. > > The math seems to be working against you on this. ok i agree the math is working against me on that idea,,,,,what about getting a huge database of already played games and use that to learn with ???? that should not take 20 years ???? im sure there are many many many computer games out there and for that matter gm games that u could use to help your program learn faster ,,,, walter irvin
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.