All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
1 Palindrome 1 (Posted on 2006-06-10) Difficulty: 2 of 5
Take a standard 8x8 chessboard, number the black squares 1 and the white squares 0. How many palindromes does this board contain in 'word-search' fashion?

Now generalize and find a formula for any n*n board.

Notes: A palindrome and its reversal should not be counted twice. A palindrome must be at least two digits long and leading zeroes are not allowed. Numbers can be read in any single vertical, horizontal or diagonal direction.

See The Solution Submitted by Jer    
Rating: 3.6667 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Question question | Comment 4 of 8 |
If n is odd, does it matter if the corners are black or white?  It would seem that would be the case, as different subsets on the main diagonals, etc. would be disqualified for leading zeroes.  Or is there some peculiar reason that this factor cancels out somewhere?
  Posted by Charlie on 2006-06-10 18:34:59
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information