TIP: Click on subject to list as thread! ANSI
echo: quik_bas
to: Gordon Shumway
from: Jasen Betts
date: 2003-03-24 17:46:54
subject: Seven Bridges

Hi Gordon.

15-Mar-03 20:00:08, Gordon Shumway wrote to All
(if that's your real name, you poor guy!)


anyway... interesting educational(?) program. but I seem to recall that
Eulers problem and his proof were a bit different, AIUI the residents of
konigsberg had given up trying to start and end at the same place.

Also on my slow old PC the path counts in "logiq" seem to go in spurts,
I'll have a look at that and see what I can do to smooth it out...


meanwhile here's another change i made.

     't100k = TIMER: FOR AA = 1 TO 100000: NEXT AA
     't100k = TIMER - t100k: IF t100k < 0 THEN t100k = t100k + 86400
     ' the following executes faster and is about as precise
     ' the number 987 works in qbasic, it may need to be changed
     ' for quickbasic (uncomment above and the "print" line
     ' below to calculete it)

     t = TIMER: WHILE t = TIMER: WEND: AA& = 0
     t = TIMER: WHILE t = TIMER: AA& = AA& + 1: WEND
     ' PRINT "number should be" t100k * aa& : end

     t100k = 987 / AA&

fwiw Eulers solutuion to the Konigsberg puzzle (as I recall it was
explained to me)

      A
    || |
     C-D
    || |
      B

 He noted that and place other than (other the start and the end place)
 would have to be departed as many time as it was arrived at,  then he
 noted that all the places had an odd number of bridges attached to them
 and thus prooved that there was no path availabe that would cross all the
 bridges exactly once.

 -=> Bye <=-



---
* Origin: Entropy isn't what it used to be. (3:640/1042)
SEEN-BY: 633/267 270
@PATH: 640/1042 531 954 774/605 123/500 106/2000 633/267

SOURCE: echomail via fidonet.ozzmosis.com

Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.