Search "user:max8x8"

I have proceeded a bit. I have obtained this code: https://pastebin.com/FKugyrXW which does 100% this: it computes the minimal number of plies between 2 fen strings which are descendants of initial_fe…

This code doesn't give a fully accurate result: https://pastebin.com/V7hu2NYY It should give -1000 if the player to move is checkmated, 0 draw, -1000+k if the player to move will be checkmated within …

It gives yet less accurate result: K = 1 _t = 0 _t = 1 Finally we found a mate! -inf AR for initial fen is = {'result': -inf, 'last_move': None, 'children': None, 'best_child': None} . . . . . . . . .…

I have a simple bug in my code:The code in python is here: https://pastebin.com/xJzREewU I have discovered a bug in my code: it says 973, but Lichess analysis says 1000-23=977, please see here: pasteb…

I have just upgraded my code for computing completely optimally for both players a chess endgame as given here: https://pastebin.com/jQ090L01 but it gives to me 2 plies to checkmate White instead of c…

https://lichess.org/editor/2kb3r/2q2p2/pp4r1/2bPp3/2p1P2p/2P2Qn1/P1B2NPP/2P1RR1K_w_-_-_0_1?color=black ?

Sorry, what do you mean ?

Hi, I think someone could still help me with my Chess Python Endgame. I've described my problem in some detail. Read on, and see if you could correct my code for which I provide a temporary version on…

I cannot say I understand what you are saying (because your numbers are too large and the code gets wrong already with [17]) but I'd appreciate if you could paste a corrected version here: https://pas…

Thank you for your interest. My observation is this: The code should select 14:: preferable to 17:: below but I do not know how to reach this sequence [14] dynamically in my code. This is also the bes…