home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #26 / NN_1992_26.iso / spool / comp / lang / pascal / 6486 < prev    next >
Encoding:
Internet Message Format  |  1992-11-11  |  737 b 
  1. Path: sparky!uunet!utcsri!torn!news.ccs.queensu.ca!qucdn!boydj
  2. Organization: Queen's University at Kingston
  3. Date: Wed, 11 Nov 1992 10:34:06 EDT
  4. From: Jeff Boyd <BOYDJ@QUCDN.QueensU.CA>
  5. Message-ID: <92316.103406BOYDJ@QUCDN.QueensU.CA>
  6. Newsgroups: comp.lang.pascal
  7. Subject: Re: Chess Puzzle
  8. References:  <1dp5hbINNbu4@west.West.Sun.COM>
  9. Lines: 11
  10.  
  11.  
  12. You only need one array of dimension 8, since you already know that there'll be
  13. only one queen in any row or column.  The values will be 1..8 in each element.
  14.  
  15. Since you asked to be "steered", I'll refrain from posting something slick :-).
  16. If you want speed, don't recurse.  If you want elegance, recurse.  Considering
  17. reflections and rotations improves on both elegance and speed.
  18.  
  19.  
  20. jeff
  21.  
  22.