home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #27 / NN_1992_27.iso / spool / rec / puzzles / 7399 < prev    next >
Encoding:
Internet Message Format  |  1992-11-20  |  877 b 
  1. Path: sparky!uunet!zaphod.mps.ohio-state.edu!usc!elroy.jpl.nasa.gov!ames!sun-barr!rutgers!igor.rutgers.edu!remus.rutgers.edu!clong
  2. From: clong@remus.rutgers.edu (Chris Long)
  3. Newsgroups: rec.puzzles
  4. Subject: Re: Gale and bridges
  5. Message-ID: <Nov.20.06.23.11.1992.10614@remus.rutgers.edu>
  6. Date: 20 Nov 92 11:23:12 GMT
  7. References: <1992Nov19.214915.18650@cc.ic.ac.uk>
  8. Organization: Rutgers Univ., New Brunswick, N.J.
  9. Lines: 11
  10.  
  11. In article <1992Nov19.214915.18650@cc.ic.ac.uk>, Nairo Aparicio writes:
  12.  
  13. > If you think this is to easy for you,  try to solve it assuming that
  14. > each bridge will collapse with independent probability "p" where
  15. > 0<=p<=1.  I have the answer for both problems, I will post them
  16. > sometime in the future.
  17.  
  18. Real puzzlers will solve the analogous problem for 3*n islands instead
  19. of just for 6.
  20. -- 
  21. Chris Long, 265 Old York Rd., Bridgewater, NJ  08807-2618
  22.