I am not storing positions in the database only hard disk addresses. The organization of the data will reveal the board position. This is an idea that I think people will have to wrap their minds around and I'd like to build the first part that is required to build the actual database in step 2. So ...

I wanted to announce that I have started a kick starter project to build and test a database structure to handle solving chess. I have discussed solving chess here and I think the community might be interested to read the details here https://www.kickstarter.com/projects/1239228060/solving-chess-yes ...

To generate moves we use 64bit attack bitboards. These are calculated at run time. Is there a header file that can be included that contains these bitboard arrays defined as a const for example. This would be useful to test with or just to use for move generation.
It just seems like this is so ...

I am needing to find a simple algorithm that can basically do a brute force proof on a board position. I am only concerned with having a systematic method of legally recreating a given chess board. I can safely assume the end position is legal, I just need to know a systematic sequence of legal ...