home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!haven.umd.edu!darwin.sura.net!Sirius.dfn.de!Urmel.Informatik.RWTH-Aachen.DE!tabaqui!dak
- From: dak@tabaqui.informatik.rwth-aachen.de (David Kastrup)
- Subject: Re: Chess Problem
- Message-ID: <dak.716324101@tabaqui>
- Sender: news@Urmel.Informatik.RWTH-Aachen.DE (Newsfiles Owner)
- Nntp-Posting-Host: tabaqui
- Organization: Rechnerbetrieb Informatik / RWTH Aachen
- References: <BuFpLp.9nI@ecf.toronto.edu>
- Date: 12 Sep 92 18:55:01 GMT
- Lines: 11
-
- rairan@ecf.toronto.edu (RAI Ranjan) writes:
-
- >In celebration(?) of the Fischer-Spasky rematch in Yugoslavia, I thought I'd post
- >a little chess problem I encountered in high school.
- >
- >Chess Problem:
- > Eight rooks are placed at random on a chessboard. What is the probability that
- > no two rooks can attack one another?
- There are {64\over8} valid configurations, of which 8! configurations
- have the desired property (in first column, 8 places to choose,
- in second 7...)
-