CTK Exchange
Front Page
Movie shortcuts
Personal info
Awards
Reciprocal links
Terms of use
Privacy Policy

Interactive Activities

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

Recommend this site

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content Products to download and subscription Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

CTK Exchange

Subject: "Euclids game"     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange College math Topic #682
Reading Topic #682
JoeGoolam
Member since Jun-3-08
Jun-03-08, 03:15 PM (EST)
Click to EMail JoeGoolam Click to send private message to JoeGoolam Click to view user profileClick to add this user to your buddy list  
"Euclids game"
 
   Enjoyed all these interesting games. I have a question regarding Euclid's game applet. I am trying to implement the same game using C++ and was wondering if you used alpha beta cutoffs in your algorithm and if so, how would someone suggest I implement the minmax procedure with the program. I coded it with basic linear searches and it works well but I do not understand how one would consider alpha beta in this situation.


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
alexbadmin
Charter Member
2232 posts
Jun-03-08, 07:22 PM (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: Euclids game"
In response to message #0
 
   >Enjoyed all these interesting games. I have a question
>regarding Euclid's game applet. I am trying to implement the
>same game using C++ and was wondering if you used alpha beta
>cutoffs in your algorithm

No, I have not. I did something very simple, viz., as soon as I generate the first two numbers, say, M and N, I form a boolean array of length

max(M, N)/gcd(M, N).

Subsequently, I simply check and upgrade entries in this array.


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

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to have a look at the old CTK Exchange archive.
Please do not post there.

Copyright © 1996-2018 Alexander Bogomolny

Search:
Keywords:

Google
Web CTK