Repository navigation
Lozza 0.2
Search fixes and the first evaluation improvements, including tapered PSTs and a bishop pair bonus.
Changes
- Allow futility to filter all moves and return oAlpha in that case.
- Fix infinite loops when showing PV.
- Fix mate killer addition condition.
- Generalise bishop counting using board.pCounts.
- Don't allow a killer to be the (current) hash.
- Don't research ALL node LMR fails unless R is set!
- Arrange things so that QS doesn't use or affect node killers/hashes etc. In tests it's less nodes.
- Increase asp window and add time on ID research.
- Add crude bishop pair bonus imp. NB: updating a piece count array using a[i]++ and a[i]-- was too slow!!
- Use tapered PSTs.
Usage
Runs in a web browser (or a web worker). There is no offline/UCI-GUI support yet; Node.js support arrived in 1.13.