Author: Dann Corbit
Date: 20:01:26 07/15/00
Go up one level in this thread
On July 15, 2000 at 22:58:40, Dann Corbit wrote: >On July 15, 2000 at 22:55:59, Dann Corbit wrote: > >>On July 15, 2000 at 22:16:37, Mark Young wrote: >> >>>On July 15, 2000 at 19:34:18, Dann Corbit wrote: >>> >>>>On July 15, 2000 at 19:24:29, Ron Norris wrote: >>>> >>>>>What will it take to get past GM blockades? >>>>>Will programmers need more knowledge, more code, cpu strength, >>>>>devine intervention? What will solve this in the future? >>>> >>>>Three or four more plies should probably do it. >>>> >>>>There may be a simple algorithmic solution. >>>> >>>>That is not the only situation that causes problems for computers, but it's >>>>probably the best one. >>> >>>3 or 4 more plies may be asking too much from the hardware as this amount of ply >>>increase would take a huge jump in computer power. This problem could better be >>>sloved with some better understanding in the program, I would think. >>> >>>I hear you are good at math, so I will ask...How much more computing power would >>>it take for Deep Junior to see 4 more plies? >> >>Assuming a branching factor of 3, that would be 3 to the 4th power = 81 times >>more. > >A bit over 6 years of doing nothing will bring that from hardware alone. Or, for a few million dollars, you could get the 64 processor 21364 next year from Compaq.
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.