Computer Chess Club Archives




Subject: Re: Everything you know is wrong

Author: Bruce Moreland

Date: 01:23:08 12/18/02

Go up one level in this thread

On December 18, 2002 at 03:52:51, Uri Blass wrote:

>I do not think that the paper claimed to prove that verification search is
>better than R=3(I agree that it was better to do it but there is a difference
>between criticizing a paper for not doing it and saying that everything that the
>author knows is wrong).
>I believe that it is better than R=3 for a lot of programs(at least at long time
>I think that the interesting question is not if the article is written correctly
>but if the idea can help programs.
>If the idea can help programs even when you can criticize the article then
>saying "everything that you know is wrong" does not seems to me correct.
>I agree that the fact that articles do not try to compare time is wrong.
>I understand the problem of the fact that time is not deterministic but
>it is still possible to use fixed estimated time.
>The program may have a global varaible with the name estimated_time that may be
>updated after every procedure so the result can be reproducable and give better
>estimate for time than the number of nodes.

"Everything you know is wrong" is a quote from the video game, "Marble Madness",
and is not designed to be a taken literally.

There were a bunch of levels, and in one of them, you had to go uphill instead
of downhill.

I enjoy the quote, since it so fully dashes previously held assumptions about
how the world works.


This page took 0.06 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.