Consolidated alphabetaMax and alphabetaMin into a NegaMax method. Fixed bug in iterative deepening loop (which was making it look like search had become fast, it's actually slower than before ID. Still a lot of tuning to do). Added capture prioritization in move ordering. Tried to optimize Positional Score evaluation, so it would generate the legal moves and store it back in the tree, or use them instead of finding them all over again if they had been calculated already.  Pretty much all of these changes ended up slowing down the engine, so they need to be fixed since apparently they weren't implemented correctly.