Chess Research Analysis Setup For research purposes, I would like to have a chess engine hooked up to a tablebase where I can be guaranteed that the chess engine is looking at ALL moves and calls the tablebase in real time in small positions. Chess engines may discard some moves on the way to calling the tablebase later, and I need to avoid that, for my purposes. At the very least I have to know that no moves, no matter how silly, have been discarded. Can anyone advise me as to what the best available setup is for this purpose? Or whether some code should be added to an open source engine?
You might find some luck looking to chess problem solvers. In chess compositions, a problem is 'cooked' if it has more than one solution (usually) or any solution that is unintended. If possible, problems are listed as C+ if they are proven by a computer to have only the intended solution(s). Obviously, these solvers do not throw away any moves to make such a proof.

Popeye Solver is one such solver. You can find more information about it on Wikipedia and the web.

You weren't very clear on what you were trying to accomplish though (this would have been important), so I'm not sure if it will work for you or not. Typically, with a program such as popeye it has a position, a stipulation, and a set of conditions. For example, a FEN position, "mate in 5", and "orthodox chess" (or perhaps varying rules).