Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: New and final solution of the Monty Hall Dilemma

Author: Peter Berger

Date: 10:47:29 09/27/02

Go up one level in this thread


On September 27, 2002 at 12:31:25, Rolf Tueschen wrote:

>Yes, writing code is easy, as someone said, but answering if the code could be
>applied seems to a bit more difficult...
>
>Have you read my post with the candidate going to the toilette in between?
>

I have read it and I came to the conclusion you won't believe me that it makes
no difference at all, whatever argument or example I come up with.

Maybe you'll have an easier time with the explanation of Brian Thomas ?
http://www.talkchess.com/forums/1/message.html?254733 - it's another approach to
explain the same thing.

You most probably will feel insulted but I think you lack basic maths to really
understand the answer to this problem in case you are serious.

One of these days I chatted with a chessprogrammer and he wanted to explain
three parameters in his program to me that controlled something called "Adaptive
Null Move Pruning" and the mechanism involved. I realized that he did a good job
and someone with a little more knowledge than me would have understood it
perfectly well - and I also got the impression that I got some kind of general
impression, but when it is about really understanding I definitely failed.

And when some other programmer would have shown up, good in rhetorics and
explained that all the explanations were nonsense and the mechanism worked in a
very different way I don't know whom I would have believed.

And to make it even worse, although I lack information and knowledge I have even
some kind of personal opinion about the topic :).

Peter




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.