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

Home > Just Math
Snails journey (Posted on 2020-12-12) Difficulty: 3 of 5
Suppose a grid with 2m rows and 2n columns is given, where m and n are positive integers. You may place one pawn on any square of this grid, except the bottom left one or the top right one. After placing the pawn, a snail wants to undertake a journey on the grid. Starting from the bottom left square, it wants to visit every square exactly once, except the one with the pawn on it, which the snail wants to avoid. Moreover, it wants to finish in the top right square. It can only move horizontally or vertically on the grid.

On which squares can you put the pawn for the snail to be able to finish its journey?

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsNecessary but not sufficientLarry2020-12-12 10:43:56
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 (1)
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