The question whether computer-chess programs can correctly decide between different strategies is investigated by means of the adjourned game Botvinnik-Fischer (Varna, 1962). Two previously-published variations are checked by FRITZ 6 and HIARCS 7.32. The analysis focuses on three strategic concepts, viz. counterattack, consolidation, and restriction. FRITZ 6 computed a counterattack perfectly. Consolidation was not found by the applied programs. HIARCS 7.32 successfully used brute force and positional knowledge for the calculation of restriction.