home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!pmafire!news.dell.com!natinst.com!cs.utexas.edu!sun-barr!olivea!spool.mu.edu!uwm.edu!ogicse!das-news.harvard.edu!das-news!kosowsky
- From: kosowsky@hall.harvard.edu (Jeffrey J. Kosowsky)
- Newsgroups: sci.math
- Subject: Re: Apology for Chess inaccuracy!
- Message-ID: <KOSOWSKY.92Sep14113609@hall.harvard.edu>
- Date: 14 Sep 92 16:36:09 GMT
- References: <BuHouB.BCF@cmptrc.lonestar.org>
- Sender: usenet@das.harvard.edu (Network News)
- Organization: Harvard Robotics Lab, Harvard University
- Lines: 21
- In-Reply-To: carter@cmptrc.lonestar.org's message of 12 Sep 92 23:49:23 GMT
-
- In article <BuHouB.BCF@cmptrc.lonestar.org> carter@cmptrc.lonestar.org (Carter Bennett) writes:
- > 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
-
- Note that thes 8! "rook distributions" correspond to the group of 8x8
- permutation matrices, or equivalently, the symmetric group of 8
- letters.
-
- Jeff Kosowsky
-