The Gateway to Computer Science Excellence
0 votes
16 views
Let there be a pile of $2018$ chips in the center of a table. Suppose there are two players who could alternately remove one, two or three chips from the pile. At least one chip must be removed, but no more than three chips can be removed in a single move. The player that removes the last chip wins. Does the first player (the player who starts playing the game) have a winning strategy in this game, that is, whatever moves his opponent makes, he can always make his moves in a certain way ensuring his win? Justify your answer.
in Numerical Ability by Boss (41.9k points) | 16 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,466 answers
195,381 comments
100,311 users