LinkBack Thread Tools Display Modes
  #1   Report Post  
Old September 6th 05, 10:26 AM
Posts: n/a
Default MTD(best)

Has somebody an understandable pseudo-code for the
MTD(best)-Algorithmus? Can somebody explain, how to prove/disprove the

I can't implement it to get the smaller tree, than for MTD(f).
In the position with a singular move, that is better, than any other by
some margin S, it's chipper to calc the big exact value, and than
prove, that everything else is worse, than try to prove it with a
smaller lower bound of the best move.

Can somebody help me?

A lot of thanks.

Thread Tools
Display Modes

Posting Rules

Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are On

All times are GMT +1. The time now is 06:00 AM.

Powered by vBulletin® Copyright ©2000 - 2019, Jelsoft Enterprises Ltd.
Copyright 2004-2019 ChessBanter.
The comments are property of their posters.

About Us

"It's about Chess"


Copyright © 2017