ACM putting chesspieces on board & possible solution
- From: jason735@xxxxxxxxx
- Date: 4 Jan 2007 05:36:17 -0800
ACM International Collegiate Programming Contest 1993
Northwestern European Regionals
http://www.acm.inf.ethz.ch/ProblemSetArchive/B_EU_NWRC/1993/nwec93a.html
my solution:
king (n+1)/2+(m+1)/2
place king on every second square horizontally and vertically
rook, queen min(m,n)
we need at least one column and one row for every piece. we know also n
queens puzzle so we can put n queens on an nxn board
knight (m*n+1)/2
place one on each square of a given color, since they move only to the
opposite color
is it enough to count this? is it so simple? :)
.
- Follow-Ups:
- Re: ACM putting chesspieces on board & possible solution
- From: Arthur J. O'Dwyer
- Re: ACM putting chesspieces on board & possible solution
- Prev by Date: Re: Enigma Reflector Algorithm (Was: Mathematics of the Enigma cipher?)
- Next by Date: Re: Algorithm to detect uniqe elements in a list
- Previous by thread: Grid Point
- Next by thread: Re: ACM putting chesspieces on board & possible solution
- Index(es):
Relevant Pages
|