ChessUSA.com TalkChess.com
Hosted by Your Move Chess & Games
 
 FAQFAQ   SearchSearch   MemberlistMemberlist   UsergroupsUsergroups   RegisterRegister 
 ProfileProfile   Log in to check your private messagesLog in to check your private messages   Log inLog in 

Evaluation speedup or (dynamic evaluation)
Post new topic    TalkChess.com Forum Index -> Computer Chess Club: Programming and Technical Discussions Flat
View previous topic :: View next topic  
Author Message
Mike Libanan



Joined: 01 Sep 2011
Posts: 123

PostPost subject: Evaluation speedup or (dynamic evaluation)    Posted: Thu Apr 05, 2012 12:27 am Reply to topic Reply with quote

First, sorry I'm just a hobbyist coder, but I have some bad opinion on
modern day eval functions.

I have browsed codes of eval() of some engines and noticed a bunch of
useless code which can't be applied on the current board position.

There are lines of code for checking if(BAD_Bishop) or if(BishopPair) or
if(King_Uncastled), which just makes the evaluation function slow due to
useless knowledge which can't be applied all the time. Like when in
endgame phase without bishops, it would be useless to keep on checking
those codes related to bishops.


GMs just uses specific knowledge and includes this to his assessment of current position on hand.
To make engines assess a position like a GM, I think Evaluation functions
can be implemented similar to the techniques used by modern malwares
like zbot/zeus. Modern/polymorphic malwares just injects some code to a
running process, and I think similar technique can be used by a chess
engine. Using this code injection techniques, chess engines can then
inject only a lean specialised knowledge, or specialised eval function,
which can be used for the current position.


Like during K+B+N vs K endgame, most engines can't announce
checkmate without the use of a TB, but if an engine can grab a file and
inject this knowledge to its own running process, then an engine can
announce mate without using a TB. Similar eval injection can be done on
specific opennings where PST can change depending on the openning, or
knowledge of R endgames.
Back to top
View user's profile Send private message
Display posts from previous:   
Subject Author Date/Time
Evaluation speedup or (dynamic evaluation) Mike Libanan Thu Apr 05, 2012 12:27 am
      Re: Evaluation speedup or (dynamic evaluation) Robert Hyatt Thu Apr 05, 2012 7:06 pm
            Re: Evaluation speedup ; dynamic evaluation Mike Libanan Thu Apr 05, 2012 11:10 pm
                  Re: Evaluation speedup ; dynamic evaluation Marco Costalba Fri Apr 06, 2012 5:39 am
                        Re: Evaluation speedup ; dynamic evaluation Sven Schüle Fri Apr 06, 2012 12:01 pm
                  Re: Evaluation speedup ; dynamic evaluation Robert Hyatt Sun Apr 08, 2012 1:51 am
                        Re: Evaluation speedup ; dynamic evaluation Mike Libanan Sun Apr 08, 2012 12:47 pm
                              Re: Evaluation speedup ; dynamic evaluation Ronald de Man Sun Apr 08, 2012 1:23 pm
                                    Re: Evaluation speedup ; dynamic evaluation Robert Hyatt Mon Apr 09, 2012 5:10 pm
                                          Re: Evaluation speedup ; dynamic evaluation Ronald de Man Mon Apr 09, 2012 7:29 pm
      Re: Evaluation speedup or (dynamic evaluation) Ricardo Barreira Thu Apr 05, 2012 8:26 pm
Post new topic    TalkChess.com Forum Index -> Computer Chess Club: Programming and Technical Discussions

 
Jump to:  
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum




Powered by phpBB © 2001, 2005 phpBB Group
Enhanced with Moby Threads