Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!wuarchive!zaphod.mps.ohio-state.edu!sunybcs!fredonia!gros1530
From: gros1530@fredonia.UUCP (Dan Gross)
Newsgroups: comp.ai
Subject: NEGMAX question
Message-ID: <1778@fredonia.UUCP>
Date: 20 Mar 90 23:47:32 GMT
Reply-To: fredonia!gros1530@cs.buffalo.edu (Dan Gross)
Distribution: usa
Organization: State University College, Fredonia, N.Y.
Lines: 19


	

	In the AI course I'm currently enrolled in, we recently discussed
Game Theory.  When we hit Knuth's and Moore's NEGMAX procedure, my other-
wise scholarly professor balked.  Unfortunately the text we are using 
is rather cryptic on this topic, so I bring my question here...
	Is the NEGMAX procedure meant to to work with 1,0,-1 evaluation
ONLY, or can it work with any evaluation with -# for loss and +# for win?
In other words, will it work if the terminal nodes are something besides the
basic -1,0,1 (ex. -2.5 -.97 .98 .34 -1.3)?
						Just curious,
						--Dan Gross

-- 
Dan Gross                                      fredonia!gros1530@cs.buffalo.edu
430 Washington Ave.          UUCP:...{ucbvax,rutgers}!sunybcs!fredonia!gros1530
Dunkirk, NY 14048-2121       Curiosity may have killed the cat,
716-366-0405                   but at least he didn't die ignorant!