Author: Bernd Nürnberger
Date: 04:43:59 03/31/04
Hello,
I am new to this message board, so I want to introduce myself briefly.
I'm a student in computer science and I am about writing a chess engine
in my spare time, named "King's Out". King's Out is written in Java and
will have a xboard/WinBoard interface and its own GUI/TextUI. I started
this project in January and now I run into some issues I cannot solve
or answer myself, so I would like to ask you some questions.
(1)
I recognized that a different move ordering delivers very alternating
results in my alpha beta search. (I implemented null move, pv search,
mvv/lva, some history moves, transposition table, quiescence search ...)
Is this a bug or is this a normal behaviour?
For example, with 3 history moves (on initial position) i get:
[...]
8. 0:01.12 993512 0.00 Nc3 Nf6 d4 d5 Nf3 Bf5 Ne5 Ne4
... and with just one more history move (4):
[...]
8. 0:01.28 1088694 0.00 e4 Nc6 Nf3 e5 d4 Nxd4 Nxd4 h6
(2)
Another move ordering issue: my move ordering is as follows:
- hash move (if there's any) (hash table 1 mio. entries)
- captures (mmv/lva)
- some history moves (experementing with 3..5)
- rest unsorted
I get a first cut rate of 60 - 80 % percent. Is this too low or just
normal for this (still somewhat poor) move ordering?
(3)
I searched the net forth to back and back to forth and cannot find any
good doc about SEE in move ordering. Does someone have a description and/or
links to descriptions, where I can read about this method?
Thanks in advance for your answers.
Greetings,
Bernd
This page took 0.02 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.