Author: martin fierz
Date: 12:04:02 03/29/04
Go up one level in this thread
On March 29, 2004 at 14:58:53, Gerd Isenberg wrote: ><snip> >>>Sorry Martin for my mathematical ignorance, >> >>gerd! you and mathematical ignorance?? gerd, the master of the bitwise operator >>universe want to claim mathematical ignorance?! >> >>>but what if you sort white moves >>>(even ply) perfect and black moves (odd ply) worst case? >>> >>>Or all-nodes perfect but cut-nodes worst (there a sill pv-nodes)? >> >>i never said i knew anything about this, instead i was looking for people who do >>know about it to answer my questions! >>let me try to answer, but i'm not so sure about this... >> >>i would think that the second part of your question is easy to answer: there you >>get the same worst case as usual. ordering all-nodes is useless (which is why >>some engines don't order moves any further after the first few, assuming they >>are all-nodes). ordering the cut-nodes worst will obviously give you no cutoffs >>either. > >Inside some cut nodes each move fails high. i see - but i think it doesn't matter. if the analysis for the worst-case of A/B is correct, then it still applies to your example too. however i admit that i don't quite understand how that analysis gets rid of those all-moves-fail-high nodes?! cheers martin
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.