a=:4 5$ 0 1 2 4 2 3 1 0 _ _ _ b=:_,.~_,._,a,_ b _ _ _ _ _ _ _ _ 0 1 2 4 2 _ _ 3 1 0 _ _ _ _ _ 0 1 2 4 _ _ 2 3 1 0 _ _ _ _ _ _ _ _ _
The goal is to find the solution paths to the pairs having three or less straight lines connections. I need to get the following solution: 1 1; 1 0; 2 0; 3 0; 3 1; 3 2 1 2; 2 2 1 3; 0 3; 0 4; 0 5; 1 5 1 4; 2 4; 2 5; 3 5 1 5; 2 5; 2 4; 3 4 2 3; 2 4; 2 5; 2 6; 3 6; 4 6; 4 5; 4 4 3 3; 4 3 Has someone already a solution to this in J? -- Björn Helgason, Verkfræðingur Fornustekkum II 781 Hornafirði, t-póst: [email protected] gsm: +3546985532 twitter: @flugfiskur http://groups.google.com/group/J-Programming Tæknikunnátta höndlar hið flókna, sköpunargáfa er meistari einfaldleikans góður kennari getur stigið á tær án þess að glansinn fari af skónum /|_ .-----------------------------------. ,' .\ / | Með léttri lund verður | ,--' _,' | Dagurinn í dag | / / | Enn betri en gærdagurinn | ( -. | `-----------------------------------' | ) | (\_ _/) (`-. '--.) (='.'=) ♖♘♗♕♔♙ `. )----' (")_(") ☃☠ ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
