Results 1 to 2 of 2

Math Help - knight's restricted walk

  1. #1
    Newbie
    Joined
    Aug 2009
    Posts
    9

    knight's restricted walk

    In how many no. of ways can a knight walk from top left square to the bottom right square of an n X n chessboard if only following 2 moves are allowed
    a) 1 right 2 down b) 1 right 2 up.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Grand Panjandrum
    Joined
    Nov 2005
    From
    someplace
    Posts
    14,972
    Thanks
    4
    Quote Originally Posted by integerfan View Post
    In how many no. of ways can a knight walk from top left square to the bottom right square of an n X n chessboard if only following 2 moves are allowed
    a) 1 right 2 down b) 1 right 2 up.
    This must consist of exactly 8 moves 6 of which are a and 2 of which are b.

    Now enumeration of legal walks under these restrictions will yield the answer (or a bit more thought might reduce the effort required further).

    CB
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. knight on the chess board
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: February 15th 2011, 12:37 PM
  2. Inverse With Restricted Domain
    Posted in the Pre-Calculus Forum
    Replies: 2
    Last Post: November 19th 2009, 11:28 AM
  3. limit with restricted ways of doing it
    Posted in the Calculus Forum
    Replies: 15
    Last Post: April 6th 2009, 05:58 AM
  4. restricted command found (def)
    Posted in the LaTeX Help Forum
    Replies: 0
    Last Post: October 9th 2008, 10:27 AM
  5. Need help on POW 12: The Big Knight Switch
    Posted in the Math Challenge Problems Forum
    Replies: 2
    Last Post: June 5th 2005, 05:35 PM

Search Tags


/mathhelpforum @mathhelpforum