Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!usc!wuarchive!rex!uflorida!haven!adm!news From: OPERMB%PACEVM.BITNET@uga.cc.uga.edu ( mike) Newsgroups: comp.lang.pascal Subject: (none) Message-ID: <25275@adm.brl.mil> Date: 15 Dec 90 13:56:23 GMT Sender: news@adm.brl.mil Lines: 33 to all subscribers, I am presently trying to develop code (in turbo pascal) to constructa game called MAXIT. It was formely used on the Commodore PET. I am following the guidelines to build it with reference to an article in the April 1989 issue of "AI Expert" ; the name of the article was "Devising a Game-Playing Strategy: The Minimax Algorithm". The program "Devising a Game-Playing Strategy: The Minimax Algorithm". The program uses the mini/max search hiearchy. It is similiar to tick-tack-toe because of its 3 by 3 matrix structure for data. The article was written by Mark Minasi..If anyone has any knowledge, advice, and or information regarding this particular topic please contact me direct via OPERMB@PACEVM. Any response is truly appreciated. thanks in advance mike _____ __________ /_____ \/ _______/ | / \\// ||| / \/ ||| / / \ / |||______ / /// \____/ | |/______ \ / /// | _____ \/| /______/// | | \ ||| Michael Baker | |_____/ ||| Pace University | / / Academic Data Center | _____ \ \ | | \ ||| | |_____/ | / |_____________/