Mymensingh Region Higher Secondary 2017/10

Forum rules
Please don't post problems (by starting a topic) in the "X: Solved" forums. Those forums are only for showcasing the problems for the convenience of the users. You can always post the problems in the main Divisional Math Olympiad forum. Later we shall move that topic with proper formatting, and post in the resource section.
samiul_samin
Posts:1007
Joined:Sat Dec 09, 2017 1:32 pm
Mymensingh Region Higher Secondary 2017/10

Unread post by samiul_samin » Tue Feb 20, 2018 9:06 am

Screenshot_2018-02-20-08-57-34-1.png
In a $16×16$ chessboard,from the $X$ signed cell, a king starts to move.In one step he can move up,down,right or left one cell.How many ways are there such that he can come back to the $X$ signed cell in $6$ steps?

User avatar
Tasnood
Posts:73
Joined:Tue Jan 06, 2015 1:46 pm

Re: Mymensingh Region Higher Secondary 2017/10

Unread post by Tasnood » Tue Feb 20, 2018 10:59 am

Think the case that an Up move will torpedo a Down move whence, a Right move will torpedo a Left move.
Now, count for $4$ moves first, and then for last $2$ moves.

samiul_samin
Posts:1007
Joined:Sat Dec 09, 2017 1:32 pm

Re: Mymensingh Region Higher Secondary 2017/10

Unread post by samiul_samin » Sun Feb 17, 2019 8:57 am

samiul_samin wrote:
Tue Feb 20, 2018 9:06 am
Screenshot_2018-02-20-08-57-34-1.png
In a $16×16$ chessboard,from the $X$ signed cell, a king starts to move.In one step he can move up,down,right or left one cell.How many ways are there such that he can come back to the $X$ signed cell in $6$ steps?
Screenshot_2019-02-17-08-56-47-1.png

Post Reply