Can 1 elo program beat 1000000000 elo program?

[Emre_1974tr]

İf A can beating B in sometimes...

İf B can beating C sometimes.

"A" must can beating "C" sometimes?İs it true according to you?

İf you are saying "yes",look at this.

1 elo program can beating 2 elo program sometimes.

2 can beating 3......

1 can beating 3 sometimes?

And

1 can beating 10000000000000(forever zero) sometimes?(it is wrong of course...)

Best regards and peace.

[Mercedes Benzene]

I don't follow you. At all.
Sorry.

[Emre_1974tr]

Originally Posted by Mercedes Benzene

I don't follow you. At all.
Sorry.

İ forgiven you my friend

[bobo69x11]

Nice topic,up up up.--------------exactly as I love to spam

[phillip1882]

i tihnk what he's geting at is this, can a program that can barely even play chess beat a master chess computer?

here's his argument, imagine that you have a program that plays random legal moves. and one that plays fairly randomly, say every 12th move is not compeletly random, and looks 1 ply deep. obviously the first cpu can beat the second one roughly 50% of the time. as you improve the cpu, the random cpu's chances of winning will diminish, but will they ever reach zero?

[arkain101]

Right. Here is my translation interpretation.

If:

A is greater than B

B is greater than C

Then A is also greater than C.

Therefore, if C was 1000000, A would still be greater.

[arkain101]

Not to mention, this is posted in a chess forum. He must be talking about chess.

Goodbye topic, as you sink to your watery grave.