Compute chess endings with a small number of men completely.

Goals: In reasonable time compute tables which allows some questions about the endgame to be answered quickly. For a given position, what is an optimal move and what would result be with optimal play? Balance initial computation time, storage and answer time.

n is number of pieces including kings and pawns. Steps:

• Make computation simple and about O(nS), storage S=2P bytes, positions P=64^n per class (Say KQvK gives P=64^3=262144) and answer time pretty quick.
• improve: storage requirement and computation while still allowing quick lookups.