Author: Koundinya Veluri
Date: 08:53:09 09/24/01
Go up one level in this thread
On September 24, 2001 at 10:34:53, Dave Gomboc wrote: >On September 24, 2001 at 07:48:59, Adrian Smith wrote: > >>Sorry i'm a bit TOO new to this :) .. can you explain to me what these mean: >> >>MTD > >memory-test driver - this is a relatively new game-tree search method. Don't >worry about it for now: look up "minimax", "alpha-beta", and "negascout" in that >order. > >>SEE > >static exchange evaluation > >>MVV/LVA > >most valuable victim, lease valuable aggressor > >SEE and MVV/LVA are two common "quiescence search" "move ordering"s. Yep, you >get to look up both of those too. :-) > >>WAC > >win at chess - this is an old book of tactics. > >>ECM > >encyclopaedia of chess middlegames - newer tactics book with tougher problems. > >>SOL > >shit out of luck :-) > >>Thanks! > >Start with: http://www.dcs.qmul.ac.uk/~icca/anatomy.htm If that's too >complicated, say so and I'll find something simpler. Older computer chess books >can be helpful when you're first starting too, because most people were just >starting back then. :-) > >Dave Other very informative sites on search techniques and evaluation methods are: http://www.xs4all.nl/~verhelst/chess/programming.html http://www.ast.cam.ac.uk/~cmf/chess/theory.html http://www.cs.vu.nl/~aske/mtdf.html http://www.ics.uci.edu/~eppstein/180a/w99.html Koundinya
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.