1. RE: range of atoms

> -----Original Message-----
> From: a.tammer at hetnet.nl [mailto:a.tammer at hetnet.nl]

> Does the chess-example include real-games or
> all kinds of theoretically possible combinations,
> in real chess allowed or not allowed, or sometimes
> even constructed beyond in real games obtainable
> positions of pieces? smile)

Looking in the _Penguin Dictionary of Curious and Interesting Numbers_ by
David Wells, the second to the last entry is Skewes number:

10^(10^(10^34)) = 10^3400

You can estimate the number of primes less than n using the integral of
n/log n from 0 to n.  This starts out as an over estimate, but switches
between that and under estimates an infinite number of times.  It's been
proved that the first switch occurs before n reaches Skewes number.  The
text states that, "At the time [1933] this was an extraordinarily large
number."  Later, Hardy figured that it was the largest number that served
any real purpose, and that if you had a chess game where all the particles
of the universe were pieces (~ 10^80 - 10^87), and a move were the
interchange of any two particles, where the game terminated after the same
positions recured three times, the number of possible games would be Skewes
number.

The largest number listed in the dictionary, however, is Graham's number:

 ^^   ^^
3||...||3

Those are really arrows pointing up.  Its a special notation created by
Donald Knuth.  This number is in the Guinness book of records (and was
featured in Scientific American), and is thought to be an upper bound for a
combinatorics problem in Ramsey theory (some experts in Ramsey theory think
the actual answer may be as low as 6).

You just can't express this number in terms of normal powers (not enough
ink/electrons/whatever):
 ^
3|3 = 3^3, but
 ^^
3||3 = 3^(3^3) = 3^27 - 7,625,597,484,987

But wait:

 ^^^     ^^  ^^      ^^
3|||3 = 3||(3||3) = 3||(7,625,597,484,987)

I think you can see where this goes.  Consider the number

 ^^^   ^^^                      ^^^^
3|||...|||3 in which there are 3||||3 arrows, and call this g1.
Now contstruct g2 where there are g1 arrows, g3 which has as g2 arrows, and
so forth until you get to g63.  This is Graham's number.

Matt Lewis

new topic     » topic index » view message » categorize

2. RE: range of atoms

THX

a@t

new topic     » goto parent     » topic index » view message » categorize

3. RE: range of atoms

Yesy, there is still a chess playing program written in Euphoria in the
Archives. I downloaded it some weeks ago. It plays a very strong game, even
in the beginner setting. It has some bugs. I am planning to examine it (when
I have some spare time left) and perhaps modifying it or translating to C or
Assembly to enhance its performance and remove the bugs. Do not expect to
have this done within next year...
----- Original Message -----
From: Juergen Luethje <jluethje at gmx.de>
Subject: Re: range of atoms


>
> Hello Ricardo,
>
> you wrote:
>
> > I, once upon a time, wrote a chess-playing program in Commodore 64
Pascal
> > and C 64 Assembly. Later, I translated it to Borland C and 8086
Assembly. I
> > still have it.
>
> By the way... Do we already have a chess-playing program, written in
> Euphoria?  smile
>
> > It has some bugs and does not play a good game. Not strange,
> > this being one of my first and last attempts to program in Pascal, C,
and
> > Assembly. But I never considered the number of possible games you
mention,
> > and only set RAM and CPU time limits.
> > Best regards.
>
> The number I mentioned was just an example to illustrate the huge number
> of possibilities in chess.
>
> Best regards,
>    Juergen
>
>
>
>

new topic     » goto parent     » topic index » view message » categorize

Search



Quick Links

User menu

Not signed in.

Misc Menu