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

Home > Just Math
Knight tour in an infinite board (Posted on 2021-04-01) Difficulty: 3 of 5
Written in each square of an infinite chessboard is the minimum number of moves needed for a knight to reach that square from a given square O. A square is called singular if 100 is written in it and 101 is written in all four squares sharing a side with it. How many singular squares are there?

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Solutioncomputer exploration and solutionCharlie2021-04-01 12:32:23
SolutionSolutiontomarken2021-04-01 07:49:57
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information