My attempts at programming. Here is a King&Rook vs King tablebase of my own construction in Python.
Source Code
An interface to the KRK table which can run in your browser:
I am interested in NP-complete problems, and am trying to find a polynomial solution to my favorite, the Traveling Salesman problem, finding the shortest complete path through a set of points, with the full set of pairwise distances between them given. The straightforward method by checking every permutation is factorial, worse than exponential, because the multiplier keeps getting higher the more points there are. NP-complete problems are equivalent in complexity level, as they can be translated into cases of each other. Another is Satisfiabilty, the question of whether a set of boolean statements can be satisfied together or not. I have source code of some projects (not NP-complete) available at github.com/lindasdon For programming or other topics, I can be emailed at lindas76don@gmail.com
Traveling Salesman Page