Your trusted source for computer chess information!

Differences

This shows you the differences between two versions of the page.

computer_chess:engines:myrddin:index 2019/01/31 01:06 computer_chess:engines:myrddin:index 2019/01/31 01:08 current
Line 73: Line 73:
====General Notes==== ====General Notes====
--- This is the first version to support SMP. The implementation is based on Dan Homan's "lazy SMP" idea. Myrddin uses multiple slave processes to fill the transposition, eval and pawn hash tables so the parent process can search deeper in the same amount of time.\\+-- This is the first version to support SMP. The implementation is based on Dan Homan's "lazy SMP" idea, but also uses a very rudimentary implementation from an idea by Harm Geert Muller. Myrddin uses multiple slave processes to fill the transposition, eval and pawn hash tables so the parent process can search deeper in the same amount of time.\\
-- Myrddin uses Pradyumna Kannan's [[http://www.pradu.us/old/Nov27_2008/Buzz/ | magicmoves]] code for move generation of sliding pieces.\\ -- Myrddin uses Pradyumna Kannan's [[http://www.pradu.us/old/Nov27_2008/Buzz/ | magicmoves]] code for move generation of sliding pieces.\\
-- Evaluation is rather simple: wood counting, piece square tables, pawn structure, rudimentary king safety, rooks behind passers. There's still a long way to go here.\\ -- Evaluation is rather simple: wood counting, piece square tables, pawn structure, rudimentary king safety, rooks behind passers. There's still a long way to go here.\\

Personal Tools