Author: Robert Hyatt
Date: 20:00:50 01/16/05
Go up one level in this thread
On January 16, 2005 at 15:37:49, chandler yergin wrote:
>On January 16, 2005 at 10:49:08, Robert Hyatt wrote:
>
>>On January 16, 2005 at 01:15:36, chandler yergin wrote:
>>
>>>On January 15, 2005 at 23:19:50, Robert Hyatt wrote:
>>>
>>>>On January 15, 2005 at 20:24:04, chandler yergin wrote:
>>>>
>>>>>On January 15, 2005 at 20:16:37, Robert Hyatt wrote:
>>>>>
>>>>>>On January 15, 2005 at 12:29:40, chandler yergin wrote:
>>>>>>
>>>>>>>New game,
>>>>>>>{D]7k/8/8/8/8/8/N7/KB6 w - - 0 1
>>>>>>>
>>>>>>>Analysis by Shredder 8:
>>>>>>>
>>>>>>>1. +- (#29): 1.Kb2
>>>>>>>2. +- (#30): 1.Nc3
>>>>>>>3. +- (#30): 1.Nb4
>>>>>>>4. +- (#30): 1.Bc2
>>>>>>>5. +- (#30): 1.Bd3
>>>>>>>6. +- (#31): 1.Nc1
>>>>>>>7. +- (#31): 1.Be4
>>>>>>>8. +- (#32): 1.Bf5
>>>>>>>9. +- (#32): 1.Bg6
>>>>>>>10. = (0.00): 1.Bh7
>>>>>>>
>>>>>>>(, 15.01.2005)
>>>>>>>
>>>>>>>Instantaneous! I don't care how 'deep' in the search.. once into the EGTB,
>>>>>>>it's there!
>>>>>>
>>>>>>Completely irrelevant. You have to first _reach_ that position, and if you
>>>>>>reach it wrongly, you reach it in a drawn position.
>>>>>
>>>>>
>>>>>That's why the Analysis module seaches E-V-E-R-Y Move in a pV
>>>>
>>>>This would be much more interesting if you had any idea about what you are
>>>>talking about. A disk I/O takes about 5ms. 20 egtb probes in a search will
>>>>burn 1/10th of a second. 200 probes will burn a second. That is _not_
>>>>instantaneous. For a program searching 2M nodes per second, the speed can slow
>>>>down to 20,000 nodes per second easily given the right position.
>>>
>>>
>>>Zeno's Paradox...
>>>
>>>Let's say you are sitting next to your wife or girfriend...
>>>
>>>You slide halfway to her...
>>>
>>>
>>>Then you slide half way closer again...
>>>
>>>Then get halfway again...
>>>
>>>Theoretically, you will NEVER Reach her...
>>
>>This is _absolutely_ wrong. Any good integral calculus book will show you why.
>>
>>hint:
>>
>>The limit of X = 1/2 + 1/4 + ... + 1/2^n for N=infinity is exactly one. Theory
>>is quite clear there.
>>
>>Now if you mean "practically you will never get there" then you would be right.
>>But if you do the 1/2 step enough times, you will get there.
>
>You Will NOT! You will NEVER Get there!
>That, IS the Paradox...
>You, learn some Math!
>Re-think your position, and DO some Math....
>then.. apologize at your leisure!
Why on earth would I apologize for _your_ error. The limit on the above
function is _exactly_ as I gave it. Apparently you have not made it through
integral calculus in any form... So a discussion is hopeless. Perhaps one day
you'll figure that out.
How is the weather in Canada???
>
>
> It is just that
>>"enough" will take forever.
>>
>>>
>>>BUT; you will get close enough for Practical purposes.
>>>
>>>STOP YOUR CRAP!
>>
>>Learn some math...
>>
>>
>>>
>>>
>>>>>
>>>>>If there are 50 "Possible" moves in a position.. it will search
>>>>>deeper and deeper... Subject to your Alpha Beta Algorithm of course...
>>>>>
>>>>>Which may or not be correct...
>>>>>
>>>>>
>>>>>Of course ya have to reach the position!
>>>>>Depending on the Static Positional Values Programmed in...
>>>>>in a Quiscent NON - Forcing position, and different engines may evaluate the
>>>>>position differntly.
>>>>>
>>>>>Right? You know I'm right!
>>>>
>>>>Hardly...
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.