Math Problem of the Day

Math Problem of the Day

Mathematical Discussion and Problem Solving

• Home
• PotD
• Bonus
• Writers
• About

Problem of the Day #359: A Knight on an Infinite Chessboard March 12, 2012

Posted by Alex in : potd , trackback

Given any constant starting location, how many positions on an infinite-size chessboard can be reached after exactly $100,000$ knight moves?

message
name email

search

• Tags

  algebra calculus combinatorics game theory geometry graph theory number theory puzzles sequences topology trigonometry

• Authors

  • Saketh
  • Alex
  • Albert
  • Seungln
  • Sreenath
  • Billy
  • Mitchell
  • Arjun
  • Aziz

• Archives

  • January 2013
  • December 2012
  • May 2012
  • April 2012
  • March 2012
  • February 2012
  • January 2012
  • December 2011
  • November 2011
  • October 2011
  • September 2011
  • August 2011
  • July 2011
  • June 2011
  • May 2011
  • April 2011
  • March 2011

• Meta

  • Log in
  • Entries RSS
  • Comments RSS
  • WordPress.org

• Feeds

• Full
• Comments