shaun/euler-project
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Automatic commit performed through alias...

Browse Source
This commit is contained in:
Shaun Setlock
2020-08-14 20:32:36 -04:00
parent bcf30d9b97
commit 5e46975586
2 changed files with 102 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/015_problem/015_problem.ipynb
View File

@@ -32,11 +32,13 @@
" 1 1 0 0 <br>\n",
"\n",
"### A couple things that shake out of this,\n",
"1. The total length of a sequence of moves is the equal to Length + Width of the grid.\n",
"1. The total length of a sequence of moves is the equal to Length + Width of the grid.<br>\n",
" 1. So, for a 20x20, each sequence will be 40 moves in length.\n",
" 1. That could 2**40 possible combinations, most of which will not be valid.\n",
"2. Each unique sequence of moves has a twin which is a mirror across the diagonal.\n",
"3. Each valid sequence has an equal number of RIGHT and DOWN moves.\n",
"\n",
"### I'm sure there is some combinatorial mathematics that describes how to do this analytically, but I'd rather practice programming a loop, than researching an elegant solution. \n",
"### I'm sure there is some combinatorial mathematics that describes how to do this analytically. That will require some research, so I'll save this problem for another day.\n",
"\n",
"---"
]