Question

C++

For this program you'll write a program that uses a recursive function. This program plays a simple token-taking game. The rules are simple 1. 2. You start the game with exactly 13 tokens. On each turn, you may do one of two things You may ask for exactly 25 more tokens; or IF the number of tokens you have is an even number, you may give back exactly half of the tokens you have a. b. 3. The object of the game is to reach exactly K tokens within N turns, where K and Nare specified at the start of each game Think about this problem recursively; if the goal is to reach, say, 34 tokens within 10 turns, andI begin with 13 tokens and choose to take 25 more, then I have 38 tokens and 9 turns left. Your program must be recursive to get full credit. Your program should ask the user for the goal number of tokens, and the number of turns allowed. It should then search and either report to the user that the total cannot be reached within the desired number of turns, or the exact sequence of moves for doing so, in order from the start state .There may be more than 1 path from the starting state to the winning state; you do not need to find them all, count them all, or find the shortest one, only find a valid path within the specified number of turns if one exists Output Sample: Enter the number of tokens you want to reach: 34 What is the number ofturns 10 Searching for solution within 10 turn (s) . . . Adding 25, you get 38 tokens Reducing by half, you get 19 tokens. Adding 25, you get 44 tokens. Reducing by hall You get 22 tokens Reducing by half, you get 11 tokens. Adding 25, you get 36 tokens Reducing by half, you get 18 tokens. Reducing by half, you get 9 tokens. Adding 25, you get 34 tokens Solution found with 1 turn (s) remaining. Would you like to play again? Y/N] Enter the number of tokens you want to reach: 79 What is the number of turns 10 Searching for solution within 10 turn (s). . Adding 25, you get 38 tokens. Reducing by half, you get 19 tokens. Adding 25, you get 44 tokens. Reducing by half, you get 22 tokens. Reducing by half, you get 11 tokens. Adding 25, you get 36 tokens. Reducing by half, you get 18 tokens. Reducing by half, you get 9 tokens. Adding 25, you get 34 tokens. Reducing by half, you get 17 tokens. Sorry, solution wasn't found within allotted turns Would you like to play again? Y/N] Thanks for playing!

Answer 1

Explanation:

• Code in C++ is given below
• Please read comments for better understanding of the code
• Output is given at the end of the code

Code in C++::

#include <iostream>

using namespace std;

void token(int k,int n,int tokenValue);

int main() {

  /**

  * Two integer variables named k and n are declared below.

  * k is used to store the token to reach

  * n stores the number of turns

  */

  int k,n;

  /**

  * Following we use while loop to take input from

  * user until user do not want to exit

  */

  while(true){

    /**

    * First we ask user to enter the value of k

    * Next we ask for the number of turns

    */

    cout<<"Enter the number of tokens you want to reach:"<<endl;

    cin>>k;

    cout<<"What is the number of turns:"<<endl;

    cin>>n;

    cout<<"Searching for solution within "<<n<<" turn(s)..."<<endl;

    /**

    * An variable named tokenValue is declared

    * initialized to 13

    */

    int tokenValue=13;

    /**

    * Now we call the recursive function named token()

    */

    token(k,n,tokenValue);

    /**

    * Prompting user if would like to play again

    */

    cout<<"Would you like to play again? [Y/N]"<<endl;

    char ch;

    cin>>ch;

    if(ch=='N' || ch=='n'){

      cout<<"Thanks for playing!"<<endl;

      /*

      * We break the while loop

      */

      break;

    }

  }

}

void token(int k,int n,int tokenValue){

  /**

  * First check if n is 0 which means all turns are taken

  */

  if(n==0){

    cout<<"Sorry, solution wasn't found within allotted turns."<<endl;

  }else{

    /**

    * Else first we check if tokenValue is equal to k

    * If yes then we print success message and turns taken

    */

    if(tokenValue==k){

      cout<<"\nSolution found with "<<n<<" turn(s) remaining."<<endl;

    }else if(tokenValue%2==0){

      /**

      * tokenValue is even then we divide it by 2 and call the function with n-1

      */

      tokenValue=tokenValue/2;

      cout<<"Reducing by half, you get "<<tokenValue<<" tokens."<<endl;

      token(k,n-1,tokenValue);

    }else{

      /**

      * If tokenValue is odd then we add 25 and

      * call the function recursivily as n-1

      */

      tokenValue+=25;

      cout<<"Adding 25, you get "<<tokenValue<<" tokens."<<endl;

      token(k,n-1,tokenValue);

    }

  }

}

OUTPUT::

Enter the number of tokens you want to reach:

34

What is the number of turns:

10

Searching for solution within 10 turn(s)...

Adding 25, you get 38 tokens.

Reducing by half, you get 19 tokens.

Adding 25, you get 44 tokens.

Reducing by half, you get 22 tokens.

Reducing by half, you get 11 tokens.

Adding 25, you get 36 tokens.

Reducing by half, you get 18 tokens.

Reducing by half, you get 9 tokens.

Adding 25, you get 34 tokens.

Solution found with 1 turn(s) remaining.

Would you like to play again? [Y/N]

y

Enter the number of tokens you want to reach:

79

What is the number of turns:

10

Searching for solution within 10 turn(s)...

Adding 25, you get 38 tokens.

Reducing by half, you get 19 tokens.

Adding 25, you get 44 tokens.

Reducing by half, you get 22 tokens.

Reducing by half, you get 11 tokens.

Adding 25, you get 36 tokens.

Reducing by half, you get 18 tokens.

Reducing by half, you get 9 tokens.

Adding 25, you get 34 tokens.

Reducing by half, you get 17 tokens.

Sorry, solution wasn't found within allotted turns.

Would you like to play again? [Y/N]

n

Thanks for playing!

Please provide the feedback!!

Thank You!!