We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I easily solved the "Simplified Chess Engine (without II)" problem. But my Python solution of this problem does not pass all tests due to timeout because of g = 1000.
I tried alpha-beta pruning with sorting of moves (taking pieces first). Then I tried hashing positions and checking if they had been encountered before. All without great success.
I think the problem can be easily solved without using any heuristics on any сompiled language. But when using slow languages this problem is not such easy.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Simplified Chess Engine II
You are viewing a single comment's thread. Return to all comments →
I easily solved the "Simplified Chess Engine (without II)" problem. But my Python solution of this problem does not pass all tests due to timeout because of g = 1000. I tried alpha-beta pruning with sorting of moves (taking pieces first). Then I tried hashing positions and checking if they had been encountered before. All without great success. I think the problem can be easily solved without using any heuristics on any сompiled language. But when using slow languages this problem is not such easy.