Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!gatech!bloom-beacon.mit.edu!news.kei.com!wang!news
From: bruck@actcom.co.il (Uri Bruck)
Subject: Re: Remember Mastermind?
Organization: ACTCOM - Internet Services in Israel
Date: Sat, 6 May 1995 14:33:57 GMT
Message-ID: <D85v4L.1qF@actcom.co.il>
References: <3o8hbg$nu8@hpavla.lf.hp.com> <creedy-0405951121400001@clreedy-mac.mitre.org>
Sender: news@wang.com
Lines: 19


: A question for comp.ai.games:  Suppose we expand the number of possible
: colors and positions to something large, say sixteen colors and sixteen
: positions, resulting in 2^64 possible patterns.  Does anyone have any good
: algorithms for finding, in a _reasonable_ period of time, possible answers
: given the results of some set of previous guesses?

:   Chris

The reffernces you sight should be a good starting point
for such speculation. I would like suggest a further variant
The pegs are arranged in a square (at least 4x4). 
The code maker replies in one color, for right color in the right position,
a sceond color for rightcolor in the wrong position, anywhere on the board,
and a third color for right color, wrong position, but in the same column/row.
can anyone suggest an analysis of this game, and how it relates to the 
original.
Uri

