Question

For this problem you need to use Mutual Recursion. This means one function will call another function which will call the first function once again.

This game is two-player game. There are m matches in a box. The players will take turns to remove matches. The player who takes the last match wins. Your friends decided to stick to a certain strategy:

1) Steve loves magic numbers. If the number of matches is divisible by 4, Steve will remove 3 matches, otherwise he will remove only 1 match. If there are 2 or less matches, Steve will take them both and win.

2) Kate loves even numbers. If the number of matches is even, Kate will remove 2 matches, otherwise she will only take 1 (so that the number of matches is even again!). If there are 2 or less matches, Kate will take them both and win.

Assume that there are m matches and the player function called goes first, who wins the game?

Output: You are expected to return one of the following strings, verbatim:

• "Steve wins the game"
• "Kate wins the game"

def steve(n):

    """

    >>> steve(1)

    "Steve wins the game"

    >>> steve(5)

    "Steve wins the game"

    """

    # YOUR CODE GOES HERE #

def kate(n):

    """

    >>> kate(1)

    "Kate wins the game"

    >>> kate(2)

    "Kate wins the game"

    """

    # YOUR CODE GOES HERE #

Answer 1

thanks for the question, here is the simple code in python.

====================================================================================

def steve(n):
    if n<=2:
        print('Steve wins the game')
        return
    if n%4==0:
        kate(n-3)
    else:
        kate(n-1)

def kate(n):
    if n<=2:
        print('Kate wins the game')
        return
    if n%2==0:
        steve(n-2)
    else:
        steve(n-1)

steve(1)
steve(5)
kate(1)
kate(2)

====================================================================================

def steve (n): if n<=2: print ('steve wins the game') return kate (n-3) else: kate (n-1) def kate (n) if n<-2: print ('Kate wins the game) return steve (n-2) else: steve (n-1) steve (1) steve (5) kate (1) kate (2)

thanks !