Computer chess time and cores

When comparing computer chess programs against one another, one can do a few things that cannot be done comparing humans against each other. One can give the weaker program a greater and greater time advantage until parity is reached (ponder off). One can adjust the number of cores a program gets and compare its performance between a greater number of cores versus a greater amount of time, i.e., its parallelization efficiency.

These experiments are more interesting than the simple numerical rating that chess engine rating sites now employ.