Skip to main content

Making moves with the Negamax algorithm

 

10 Sept 2022

after a loooonngg time!!!

4:50 am

  • there's a lot to tell you, but firstly, i'm very happy now because i just teached my ai to capture pieces and guess what, it doesn't just look one move into the future. yes guys, i wrote the negamax algorithm!! it's much more fun to play with it now. but still it has to prioritize other things besides captures, like promotions, checks, pins etc. and obviously, mates!
  • now i'm going to sleep as i got many works to do :(

Comments

Post a Comment

Popular posts from this blog

Faster move generation, Mate in X tests

  24 Dec 2022 1:30 am better  uci  handling, using  istringstream  to parse commands better Mate Score output added Mate in 2, 3, and 4 tests (and they pass! but slow) inlined some functions (maybe faster now?) added Search Type:  Infinite ,  Fixed Depth ,  Time per Move ,  Time per Game ,  Ponder  and  Mate . Not all of them are working yet :') 3 am movelist.reserve(40) : doing this made move generation ~1.5x faster! Now reserving in all vectors. modularized move generation added  get_threats  function
Post a Comment
Read more

Engine understands clock and avoids draws

  28 Oct 2022 3 am bugfixes: fixed hard to find enpassant bug! AI part: code refactorings engine understands clock!! BIGGEST UPDATES: iterative deepening mate distance pruning null move pruning late move reduction others: simplified position hash engine now avoids draws! TODO: verify all of them, i guess i'm rushing into adding more and more features. i've spent around one week on this commit, now it's time for me to focus on my academics :|
Post a Comment
Read more