Raven is a chess engine written in C that uses the UCI protocol.
Rating JCER=2748, Author: Steve Griffin
New Features:
Search:
Limit reduction of moves with good history to one ply.
Multi-cut pruning.
Allow TT hits of non-exact TT entries with depth greater than current depth.
Use killers from two plies ago in move sorting.
Only use probcut at expected cut nodes.
Allow null move pruning in endgame but with reduced search reduction.
Reduce by an extra ply in LMR for very late moves (move count >= 20).
Only use null move pruning if static eval or TT score indicate a fail high.
Eval:
Penalty for not having castled and not having castling rights.
Bonus for attacking centre in mobility.
All files (games, tables and engines) - download from page
Raven 0.90 download
Rating JCER=2748, Author: Steve Griffin
New Features:
Search:
Limit reduction of moves with good history to one ply.
Multi-cut pruning.
Allow TT hits of non-exact TT entries with depth greater than current depth.
Use killers from two plies ago in move sorting.
Only use probcut at expected cut nodes.
Allow null move pruning in endgame but with reduced search reduction.
Reduce by an extra ply in LMR for very late moves (move count >= 20).
Only use null move pruning if static eval or TT score indicate a fail high.
Eval:
Penalty for not having castled and not having castling rights.
Bonus for attacking centre in mobility.
All files (games, tables and engines) - download from page
Raven 0.90 download
Comments
Post a Comment