Time-bounded algorithm for two-player games

We present a time-bounded algorithm for two-player games, which generates partial game trees in accordance with the theme that when comparing the values of several alternative moves, the criterion should depend not only on their apparent scores but also on the amount of time already expended in their examination. We show that such an algorithm admits an interpretation as a generalized minmax search.