Implemented modified Late move reduction (LMR) - Napoleon 1.3.2

- Implemented a new form of LMR
	- With adaptive parameters and reductions based on static evaluation
- Modified moves sorting
	- Inside quiesce we now sort the moves by mvv-lva
	- We use SEE inside full-width search
- Introduced PV-nodes recognition
- Don't save pruned nodes (futility pruning) inside Hash table
- Modified PVS. We now search only the first node at full-width
- Disabled internal iterative deepening
- New way of trying hash-move

Results:
Self play games show that the newer version is stronger than the older one.
Adaptive LMR reduces most of the futile moves at the bottom of the tree,
while reducing only a minimal part of the tree near the root.

New Version 1.3.2