Recursive Integer Guessing Game
An integer guessing 'game' for a
function `isleq', that returns true for
all values less than or equal to a
mystery number.
Syntax: z=guessgame(isleq,n,k)
In tertiary function notation:
g(n,k) =
| k==0 :: isleq(n) ? n : n+1;
| k>0 :: isleq(n+(2^k)-1) ?
g(n,k-1) : g(n+2^k,k-1);
| k<0 :: isleq(n+(2^(-k))-1) ?
g(n,(-k)-1) : g(n+(2^(-k)),k-1);
g(n,-k) for -k negative refers to an
unbounded search [n,inf] with current
search depth up to (n+2^(-k)-1) :
e.g. g(15,-4) denotes [15,30].
g(n,k) for k positive refers to a
search over the interval
[n,(n+(2^(k+1))-1)] :
e.g. guess(63,5) denotes [63,126].
Initial function should be run with n
set as a lower bound (default 1).
Function isleq can be replaced with an
integer instead.
Cite As
Adam Gripton (2024). Recursive Integer Guessing Game (https://www.mathworks.com/matlabcentral/fileexchange/35787-recursive-integer-guessing-game), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxTags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |