穿越網格愛上你
在此文中我們研究: 一個 n×4 的長方形網格中,所有從(1, 1)或(1, 4)出發,在不重複且經過每個格子點的情況下,走到(n, 1)結束的所有路徑總數分別為 Tn 、Un。
In our research, we study a n× 4 rectangular network lattice, of which all the routes are starting from (1, 1) (resp.(1, 4)), and ending at (n, 1) (situations are considered only on the conditions of passing every spot and not being repeated ). And we set the sum of all the different routes as Tn (resp. Un).