A few things to debate for my chess engine

[ZirconiumX]

Does anyone know of any more easy to implement move ordering techniques?

Matthew:out

[hgm]

More easy than what? Micro-Max only picks a single move to search first (the hash move, or if there is none, the best move of the previous iteration, or if there was none, the best MMV/LVA capture), and searches the rest in move-generation order. There is no killer, and no history. But the strength is accordingly...

Actually it is not that bad, because micro-Max does IID in every node, on a hash miss always starting with d=0 (QS), and even before (the iteration before the one that searches the captures determines the best MMV/LVA move). Because of this, it does effectively search all captures before non-captures, as d=0 skips the captures. When it gets to d=1 it searches both captures and non-captures, but the captures are then guaranteed hash hits.

[ZirconiumX]

Easier than performing brain surgery?!

I'm playing a game with LUCI. White is me - Black is LUCI.

Code: Select all

1. e4 e5 2. Nf3 Nf6 3. Nxe4 Qe7 4. Nf3 Qxe4+! 5. Qe2 Be7 6. Qxe4 Nxe4 7. d3 Nf6 8. c4 (I'm getting desperate) d5 9. b3 dxc4 10. bxc4

More coming...

Matthew:out

[ZirconiumX]

Code: Select all

1. e4 e5 2. Nf3 Nf6 3. Nxe4 Qe7 4. Nf3 Qxe4+! 5. Qe2 Be7 6. Qxe4 Nxe4 7. d3 Nf6 8. c4 (I'm getting desperate) d5 9. b3 dxc4 10. bxc4 Bg5 11. Bb2 Nc6 12. Nd2 Bb4 13. Rc1 Kf8 (No castling) 14. h3 Re8+ 15. Be2 Bf5 16. g4

Matthew:out

[ZirconiumX]

Code: Select all

1. e4 e5 2. Nf3 Nf6 3. Nxe4 Qe7 4. Nf3 Qxe4+ 5. Qe2 Be7 6. Qxe4 Nxe4 7. d3 Nf6 8. c4 (I'm getting desperate) d5 9. b3 dxc4 10. bxc4 Bg5 11. Bb2 Nc6 12. Nd2 Bb4 13. Rc1 Kf8 (No castling) 14. h3 Re8+ 15. Be2 Bf5 16. g4 Bd3 17. a3 Rxe2 18. Kf1 Bxd2 19. Kg2 Bxc1 20. h4 Bb2 21. Kg3 Ne4+ 22. Kf4 Nf2 23. Rh2 Ne4 24. h5 Bc4 25. Nxe5 1-0 (LUCI resigns (score +24.06 pawns)

Matthew:out