mohamed.gaber's blog

By mohamed.gaber, 13 years ago, In English
we have an infinite chess board and we want to move from the position x1,y1 to the position x2,y2 using the minimum number of knight's moves.
I believe that this problem has a constant time solution but i couldn't approach it.
I would be grateful if any one explained the solution of this problem.
Thanks in advance.

Full text and comments »

  • Vote: I like it
  • +3
  • Vote: I do not like it

By mohamed.gaber, 13 years ago, In English

This is my blog http://gabertc.blogspot.com/  my posts on it will be dedicated to Algorithms and problem solving techniques.

Full text and comments »

  • Vote: I like it
  • +14
  • Vote: I do not like it

By mohamed.gaber, 14 years ago, In English
please any one solved this problem explain the idea of it please.
thanks in advance.

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it