algorithm - Tic-Tac-Toe Strategy - 60's MiniVac 601 Logic -

tic-tac-toe seems solved problem space, 100% solutions seem search through finite tree of possibilities find path winning.

however, came across computer-simulation toy 60's, minivac 601. http://en.wikipedia.org/wiki/minivac_601

this 'comptuer' consisted of 6 relays hooked solve various solutions. had game section, had description on program tic-tac-toe, claims unbeatable long minivac went first.

since solutions seem require lots of memory or computational power, surprising see solution using computer of 6 relays. haven't seen algorithm before, not sure can figure out. attempts solve on pad , paper seem indicate easy win against computer.

http://www.ccapitalia.net/descarga/docs/1961-minivac601-book5&6.pdf

"with program, mini vac can not lose. human opponent may tie game, can never win. because of decision rules basis of program. the m in iv c programmed machine move 5 squares right of own last move if , if human opponent has blocked last move moving 4 squares right of machine's last move. if human player did not move 4 squares right of machine's last move, m in iv c move square , indicate win. if hu­ man player consistently follows "move 4 right" rule, every game end in tie. program requires m in iv c make first move; machine's first move center of game matrix. program allow human opponent move first require more storage , processing capacity available on m in iv c 601. such program would, of course, more complex program permits machine move first"

edit: ok question little more explicitly: real solution solving tic-tac-toe? recognize algorithm, seems very simple not searchable.

i think in layout of "board". if @ 601 units tic-tac-toe area, 9 in middle , 1 top left numbered sequentially clockwise around 9.
"computer" goes first in 9 position. user goes next. if user hasn't gone in position 1 (top left) next position computer. user goes next. computer tries go in position 1+4 (5 - bottom right). if position not available go in 1+5 (6 - bottom middle). x + 4 opposite previous move, , since computer has center position winning move.