Author: José Carlos
Date: 14:33:27 04/12/02
Go up one level in this thread
On April 12, 2002 at 11:08:10, Uri Blass wrote: >On April 12, 2002 at 10:57:40, Miguel A. Ballicora wrote: > >>On April 12, 2002 at 09:30:45, Uri Blass wrote: >> >>>On April 12, 2002 at 09:14:22, Oren Avraham wrote: >>> >>>>I've gone through the archive to look for a simple idea >>>>but found non: >>>>Why every ply should i generate the pseudomoves all over again, when i can >>>>"recycle" the old ones in some way or another. >>> >>>You do not have to generate the pseudomoves all over again. >>>I believe that programmers are usually not very good programmers >>>so they choose to do it because recycling >>>the old ones without bugs is too hard for them or takes >>>too much time that they prefer to invest time in other things >>>because they may get only a small speed improvement from >>>recycling the old moves. >> >>That is actually what a good programmer would do, not a bad one. >> >>Regards, >>Miguel > >No > >If you can implement idea that gives you 5% speed improvement >in 24 hours without bugs then I see no reason not to do it. > >The problem is that I believe that most if not all >the programmers simply canoot do it because they >are not good enough. > >Uri Miguel said it perfectly. I'll only add that you don't understand what a good programmer is. A good programmer writes code that is good enough, clear enough, fast enough, easy to write and modify, reusable enough, portable enough... In summary, perfection doesn't exist in programming, it's a matter of the best compromise. Those who understand where the best compromise is, and are able to achieve it, are good programmers. And when it comes to improve a finished program, the good programmer focuses on the points where he can get the biggest improvement. In chess, a 5% speed means 2 or 3 elo points. No good programmer on earth will mess the code up to get that improvement. That's why all good programmers out there have so good eval and so good search. And don't forget that the move generator takes usually less than 10% of the total search time, so your 5% means to halve the time of the move generator. There's absolutely no way that your idea halves move generation time. José C.
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.