football_dynamic, a Python code which uses dynamic programming to count the ways a given particular score can be achieved in football, respecting the order of events.
To be clear, this code only considers the score of one team. Moreover, in reaching a score, the sequence in which points were made is considered significant. Thus, the two sequences 6 + 3 and 3 + 6, which both achieve a score of 9, and contain the exact same values, are counted as different ways of doing so. They certainly would be experienced differently in live action.
The information on this web page is distributed under the MIT license.
football_dynamic is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
change_dynamic, a Python code which uses dynamic programming to solve the change making problem, which counts the number of ways a given sum can be formed using coins of various denominations.
football2_dynamic, a Python code which uses dynamic programming to count the ways of achieving a given score in football, respecting the order of events.
knapsack_dynamic, a MATLAB code which uses dynamic programming to solve a knapsack problem.
matrix_chain_dynamic, a Python code which finds the cost of the most efficient ordering to use when multiplying a sequence of matrices, using dynamic programming.
python_combinatorics, a Python code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.