home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!cs.utexas.edu!convex!egsner!lerami!cmptrc!carter
- From: carter@cmptrc.lonestar.org (Carter Bennett)
- Subject: Apology for Chess inaccuracy!
- Summary: Boy, is my face red!!!
- Message-ID: <BuHouB.BCF@cmptrc.lonestar.org>
- Sender: carter@cmptrc.lonestar.org
- Date: Sat, 12 Sep 1992 23:49:23 GMT
- Organization: CompuTrac Inc., Richardson TX
- Lines: 29
-
- Boy, is my face red!!!
-
- Thanks to Richard Pinch and Toby Kelsey for pointing out the error
- in my ways! I found my mailbox this morning with their polite notes
- pointing out my mistake. I'm glad they did that. I hope I'm a
- better mathematician for it.
-
- There are certainly more than two distributions of 8 rooks where no
- two can attack one another. Richard sent a couple of messages, the first
- containing only the figure below.
- @ - - - - - - -
- - @ - - - - - - My (inaccurate) assumption was that the rooks would
- - - @ - - - - - have to be lined up on one of the two diagonals. As
- - - - @ - - - - shown here, this is not true. Had I though this through
- - - - - @ - - - correctly, I should have realized that I could consider
- - - - - - @ - - one diagonal and allow all permutations of rows (or all
- - - - - - - - @ permutations of columns, if you prefer, but not both).
- - - - - - - @ -
- The upshot of this is that there are 8! distributions of 8 rooks that
- meet the criteria that no two can attack each other; not 2, as I said
- earlier. >-X
-
- So, the chances of coming across this randomly are:
- 40320 in 4426165368 -> 560 in 61474519 or approximately 1 in 109776.
-
- Carter R. Bennett, Jr. - Scientist No matter where you go...
- carter@scilab.lonestar.org - home .../dev/tty!
- carter@cmptrc.lonestar.org - work
- KI5SR
-