I'm looking for some reference for the number of lookahead steps typically used by chess agents (Stockfish / Leela Chess Zero / others?)
From a quick search I found that: the answer depends on:
- complexity of position,
- computer hardware/processor speed,
- efficiency of software/graphics interface,
- time given to the chess engine.
with somewhat mediocre hardware a depth around 15 ply's in one second is typical.
the NPS value for the Stockfish engine: 49,473 kN/s (calculating 49,473,000 positions (nodes) per second).