Earlier quoted context omitted.
is there some reason to implement it as a time limit instead of iterations or something else deterministic? it being affected by CPU speed or machine load seems obvious. or whatever makes sense if “iterations” isn’t a thing, I know nothing about chess algorithms
A time limit is also deterministic in some sense. Level settings used to be mainly time based, because computers at lower settings were no serious competition to decent players, but you don't necessarily want to wait for 30 seconds each move, so there were more casual and more serious levels. Limiting the search depth is much more deterministic. At lower levels, it has hilarious results, and is pretty good at emulati…
Okay, but I want to point out nobody was suggesting a depth limit.
For a time-limited algorithm to work properly, it has to have some kind of sensible ordering of how it evaluates moves, looking deeper as time passes in a dynamic way.
Switch to an iteration limit, and the algorithm will still have those features.