In my chess engine I have some language/platform limitations. I've been using a TT table in the past but it didn't work very well, now i want to re-implement it ...

Given that I can only have 32bit hashes, what would be the best TT size? I assume it depends on the search depth as well, which is in ...

I was wondering about the History Heuristics as well, so rather than opening a new topic, I'd like to ask a few questions here:

- HH seems a more general case of Killer Moves, wouldn't they be preferred over KM?
- at what ply depth do they start to become irrelevant? 6? 8?
- should they be ...

Thanks a lot for the code, I'm "decoding" now

Just to be clearer, I'm looking for iterative alpha-beta pruning. I can use conditionals and loops, but no gotos.

I want to change the usual recursive negamax search into an iterative one. I am implementing chess into a rather primitive environment (if not downright hostile) and the iterative approach would provide benefits.

I've been looking but I couldn't find one semi-legible working code. I'd love to see ...