The streets of a city are arranged like the lines of a chess-board. Let the dimensions be $m \times n$. Find the number of ways in which a man can travel from the North-West corner to the South-East corner, going the shortest possible distance.

Question

karatechopper · Answer

thts a lot of turns i can take x(

experimentx · Answer

Kinda sounds like problem asked by FFM

karatechopper · Answer

who know when i could get lost :/ @Diyadiya  will drive me! then no need to worry!

anonymous · Answer

It is similar to FFM's problem.

experimentx · Answer

then it must be related to this http://en.wikipedia.org/wiki/Motzkin_number

experimentx · Answer

n+1th Mozkin's no

karatechopper · Answer

@Ishaan94  i have an answer

karatechopper · Answer

o wait not yet!

experimentx · Answer

|dw:1339345895603:dw|
seems to be six int this case