si decodificarea ar fi

== code (cpp) |dir = x % 8; x /= 8;

== code(cpp) |dir = x % 8; x /= 8;

j = (x % m) + 1;
i = (x / m) + 1;
==

== code(cpp) |for (dir =0; dir < 8; dir++)
    lst[0].add(starti,startj,dir,0);

    current_cost = 0;
    while (lst[0].size()+lst[1].size()+lst[2].size>0){
        while (lst[curent_cost % 3].size()>0) {
            x = lst[curent_cost % 3].pop();
            expand(x);
        }
        curent_cost++;

current_cost = 0;
while (lst[0].size()+lst[1].size()+lst[2].size>0){
    while (lst[curent_cost % 3].size()>0) {
        x = lst[curent_cost % 3].pop();
        expand(x);

    }

    curent_cost++;
}

==
Am folosit numai trei liste pentru ca am tinut cont de optimizarea precizata mai sus de a nu folosi numai curbele la 0 grade, 45 grade si 90