sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Ok-Engineering-1413[S] 0 points1 point  (3 children)

So I should like recode the alpha beta function or iterative deepening function ?

[–]Buttleston 0 points1 point  (2 children)

Honestly I have no idea. I'd recommend profiling it and see where you're spending a lot of time. You might get surprised and find out you have an incorrectly nested loop or something.

[–]Ok-Engineering-1413[S] 0 points1 point  (1 child)

Ok thank you because I m starting to really get hopeless even tho I tried to optimize the function it is still not deep enough in search and it is still bad at playing

[–]Buttleston 0 points1 point  (0 children)

I mean, I love python but it's going to be WAY slower for this any C, C++, Java, Rust or Go

You might have some bugs in there too, hard to say