How to resolve the algorithm Nim game step by step in the R programming language

Published on 12 May 2024 09:40 PM
#R

How to resolve the algorithm Nim game step by step in the R programming language

Table of Contents

Problem Statement

Nim is a simple game where the second player─if they know the trick─will always win.

The game has only 3 rules:

To win every time,   the second player simply takes 4 minus the number the first player took.   So if the first player takes 1,   the second takes 3; if the first player takes 2,   the second should take 2; and if the first player takes 3,   the second player will take 1. Design a simple Nim game where the human player goes first, and the computer always wins. The game should enforce the rules.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Nim game step by step in the R programming language

Source code in the r programming language

## Nim game
##

tokens <- 12

while(tokens > 0) {
  print(paste("Tokens remaining:",tokens))
  playertaken <- 0
  while(playertaken == 0) {
    playeropts <- c(1:min(c(tokens,3)))
    playertaken <- menu(playeropts, title = "Your go, how many tokens will you take? ")
    tokens <- tokens - playertaken
    if(tokens == 0) {print("Well done you won, that shouldn't be possible!")}
  }
  cputaken <- 4 - playertaken
  tokens <- tokens - cputaken
  print(paste("I take",cputaken,"tokens,",tokens,"remain"))
  if(tokens == 0) {print("I win!")}

}

You may also check:How to resolve the algorithm N-queens problem step by step in the SQL programming language
You may also check:How to resolve the algorithm Sudoku step by step in the REXX programming language
You may also check:How to resolve the algorithm Flipping bits game step by step in the 8080 Assembly programming language
You may also check:How to resolve the algorithm File input/output step by step in the Kotlin programming language
You may also check:How to resolve the algorithm User input/Text step by step in the Elixir programming language