CTK Exchange
Front Page
Movie shortcuts
Personal info
Reciprocal links
Privacy Policy

Interactive Activities

Cut The Knot!
MSET99 Talk
Games & Puzzles
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Math as Language
Things Impossible
My Logo
Math Poll
Other Math sit's
Guest book
News sit's

Manifesto: what CTK is about |Store| Search CTK Buying a book is a commitment to learning Table of content Things you can find on CTK Chronology of updates Email to Cut The Knot

CTK Exchange

Subject: "Mastermind - Maximum number of tria..."     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange This and that Topic #139
Reading Topic #139
Josť Alberto (Guest)
Aug-05-01, 05:26 PM (EST)
"Mastermind - Maximum number of trials"
   Hi all

Thanks in advance for answering my question.

I'm programming a MasterMind game and I'm stuck on how to assign the maximum number of tries that should be permitted. I read in this web page that, for the 4 balls and 6 colors variant (the normal one), a solution is guaranteed (by an algorithm) in 5 tries or less. My question is:

1) Not everyone knows the algorithm nor can deduce it that fast; which number of maximum tries would be decent to permit?

2) How about the r^n variation, where n is number of balls and r is number of colors? Is there a way to determine a "decent" number of trials permitted?

Thank you so much.

My e-mail: jovera@internet.com.mx

JosŤ Alberto Bonilla
Mexico DF
- Applied mathematics (ITAM)
- Actuarial science (ITAM)

  Alert | IP Printer-friendly page | Edit | Reply | Reply With Quote | Top
Charter Member
672 posts
Aug-07-01, 10:23 AM (EST)
Click to EMail alexb Click to send private message to alexb Click to view user profileClick to add this user to your buddy list  
1. "RE: Mastermind - Maximum number of trials"
In response to message #0
   >I'm programming a MasterMind game and
>I'm stuck on how to
>assign the maximum number of
>tries that should be permitted.
>I read in this web
>page that, for the 4
>balls and 6 colors variant
>(the normal one), a solution
>is guaranteed (by an algorithm)
>in 5 tries or less.

This is exactly as much as I know.

>My question is:
>1) Not everyone knows the algorithm
>nor can deduce it that
>fast; which number of maximum
>tries would be decent to

Well, this is a matter of design. You may probably have several difficulty levels with progressivlely fewer guesses alowed.

>2) How about the r^n variation,
>where n is number of
>balls and r is number
>of colors? Is there a
>way to determine a "decent"
>number of trials permitted?

I've no notion. Perhaps you can use a scroll window.

  Alert | IP Printer-friendly page | Edit | Reply | Reply With Quote | Top

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to visit the old CTK Exchange archive.

|Front page| |Contents|

Copyright © 1996-2018 Alexander Bogomolny

[an error occurred while processing this directive]

New Books
Second editions of J. Conway's classic On Numbers And Games and the inimitable Winning Ways for Your Mathematical Plays