I have a problem as described here with Python's code designed to solve trivial endgames

I'm having problems with a Python code which is supposed to solve an endgame with 3 pieces on the board: K+Q+k
as described here

chess.stackexchange.com/questions/44862/i-have-a-code-in-python-which-should-compute-fully-optimal-moves-in-an-endgame-f

The code tells me that in some particular position there is a forced mate in 9 plies while the correct number is 11,
please see the link above.

Isn't king between node 1190 and node 3743 (ply 4.) walking straight into his own execution? Stockfish says that if he went anywhere else, the eval would stay #5, but since he went up, the eval changed to #4, making it two plies faster.

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 best initial move suggested by StockFish.

Yes, that problem comes because of the problem in node 1190, where it chooses node 3743 instead of any different node. Are you sure that the enemy side (here: black) chooses the best move for itself (which means, best for black) instead of the best move for white? Because right now in that node it chooses the best move for white instead. That's where the issue stems from.

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:

pastebin.com/ and give me a public link to it in here ?

What I believe is this:
The problem is that it selects A[1]['sequence'] == [17] instead of == [14], could you kindly fix this issue ?
I've been trying it for almost a week now.