Monkey see Monkey do. Romi remembers and incorporates winning lines regardless of which side played the moves into the opening book and can play them back instantly up to 180 ply if the stats for that line remain good.
Pavlov'sdog experiments adapted to computer chess. Each sides moves are given a slight bonus if that side has won and the other sides moves are given a slight penalty. So, good moves can get a slight penalty and bad moves can get a slight bonus, however, through time those are corrected. These bonus/penalties are loaded into the hash table before each move by the computer. If Romi is loosing game after game then this will cause Romi to 'fish' for better moves to play until Romi starts to win.
a WinBoard compatible chess engine written by Michael Sherwin in C, first released in June 2005 [1] , version p3k is available as open source from Jim Ablett's WinBoard chess projects. RomiChess is famous for its learning approach [2] , and uses bitboards as basic data structure, in particular Sherwin Bitboards to determine sliding piece attacks [3] . Its search is alpha-beta with transposition table, null move pruning and LMR inside an iterative deepening framework with aspiration windows. Romi's evaluation features an oracle approach of pre-processing piece-square tables at the root [4] . It played the ACCA 2006 and ACCA 2008 ACCA Americas' Computer Chess Championships, and the WCRCC 2008 ACCA World Computer Rapid Chess Championship.
Table of Contents
Learning
As explained by Michael Sherwin, RomiChess uses two types of learning [6] :Selected Games
ACCA 2006, round 4, Arasan - RomiChess [7]See also
Forum Posts
2005 ...
2010 ...
2015 ...
External Links
Chess Engine
Misc
Return on marketing investment from Wikipedia
6019. Who? (C.N. 6006) - Chess Notes by Edward Winter
References
What links here?
Up one level