Pascal classic algorithm explanation - Knight travel problem

From , 5 Years ago, written in Delphi (Object Pascal), viewed 106 times.

fillchar(map,sizeof(map),0);
map[x1,y1]←1；
for i←x1+1 to x2 do
  for j←1 to m do
     map[i,j]←map[i-1,j-2]+map[i-1,j+2]+map[i-2,j-1]+map[i-2,j+1];
writeln(map[x2,y2]);
 
 

Reply to "Pascal classic algorithm explanation - Knight travel problem"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters

https://burned.cc - Burn After Reading Website

Pastebin.vip

Pascal classic algorithm explanation - Knight travel problem

Reply to "Pascal classic algorithm explanation - Knight travel problem"