One way to compare chess-playing programs is to compare how they perform with fixed time limits per move  Given any two computers with which a chess-playing program is compatible, and given fixed time limits per move, such a program will have a better chance of winning on the faster computer
This is simply because the program will be able to examine more possible moves in the time allotted per move
If one chess-playing program can examine more possible moves than a different chess-playing program run on the same computer under the same time constraints per move, the former program will have a better chance of winning than the latter.