Author: Russell Reagan
Date: 12:53:33 05/11/02
I've heard people talk about how it matters more which algorithms you use more than it matters what language you choose or doing little optimizations here and there. I'm curious if this means that instead of worrying about if "this will run a little faster if I use a pointer instead of a global variable", they recommend that I should spend my time worrying about algorithms. Well, I'm not really sure how I'm supposed to do this. I mean, as far as I know, there are alpha-beta and it's cousins, null move, etc. So what exactly am I supposed to be worrying about? One thing that comes to mind is working on better move ordering for alpha-beta. Is this an example of what you mean by "working on using better algorithms"? Anyway, if someone could explain this and give some examples of what is meant by this, I would appreciate it. Russell
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.