* It may run faster using forkphorus player: forkphorusでより早く計算します： https://forkphorus.github.io/#373074316 A simple program to illustrate the number of self-avoiding paths in a square matrix. 0x0 to 4x4: 1, 2, 12, 184, 8512 It takes lots of time to calculate 5x5 (1262816), and even more time for 6x6 (575780564) (and above) due to combinatorial explosion. (So using an unoptimized exhaustive algorithm to solve The Witness puzzle is not a good way)
Original Video:『フカシギの数え方』 おねえさんといっしょ！ みんなで数えてみよう！ https://www.youtube.com/watch?v=Q4gTV4r0zRs 「フカシギの数え方」 同じところを2度通らない道順の数 https://www.youtube.com/watch?v=ge8vy4tc_kQ OEIS: https://oeis.org/A007764 同じところを2度通らない道順の数 Total number of routes that do not pass by the same place twice (Self avoiding paths)
