## Predict the winner of the game on the basis of absolute difference of sum by selecting numbers

Given an array of N numbers. Two players X and Y play a game where at every step one player selects a number. One number… Read More »

- Predict the winner of the game | Sprague-Grundy
- A modified game of Nim
- Count the numbers that can be reduced to zero or less in a game
- Find the winner of the game with N piles of boxes
- Probability of A winning the match when individual probabilities of hitting the target given
- Find the winner by adding Pairwise difference of elements in the array until Possible
- Find probability that a player wins when probabilities of hitting the target are given
- Chessboard Pawn-Pawn game
- Find the number of players who roll the dice when the dice output sequence is given
- Minimum number of integers required to fill the NxM grid
- Predict the winner of the game on the basis of absolute difference of sum by selecting numbers
- Some Tricks to solve problems on Impartial games
- Number of ways for playing first move optimally in a NIM game

Given an array of N numbers. Two players X and Y play a game where at every step one player selects a number. One number… Read More »

Given a string S and a number X. There are M players who roll the dice. A player keeps on rolling the dice until he… Read More »

How to solve problems that fall in the Finders keepers category in ‘Game Theory’? Note- Finders keepers game fall into the category of ‘Impartial Games’… Read More »

Two players A and B are playing NIM Game with each other. Both are playing optimally. Player A starts the game. The task is to… Read More »

Given four integers a, b, c and d. Player A & B try to score a penalty. Probability of A shooting the target is a… Read More »

There is a 8*8 chessboard and two chess players having a single pawn each. A player has to move his pawn in each turn, either… Read More »

Given a grid of size (NxM) is to be filled with integers. Filling of cells in the grid should be done in the following manner:… Read More »

Given an array arr[] of integers, two players A and B are playing a game where A can remove any number of non-zero elements from… Read More »

Given an array arr[] of positive distinct integers, two players A and B are playing a game. At each move, a player selects two numbers… Read More »

Given two integers X and Y and an array of N integers. Player A can decrease any element of the array by X and Player… Read More »

Given four integers p, q, r and s. Two players are playing a game where both the players are hitting a target and the first… Read More »

Given a 4×4 binary matrix. Two players A and B are playing a game, at each step a player can select any rectangle with all… Read More »

Given N piles containing White(W) and Black(B) boxes only, two players A and B play a game. Player A may remove any number of boxes… Read More »

Given ‘n’ vertices and ‘m’ edges of a graph. Find the minimum number and maximum number of isolated vertices that are possible in the graph.… Read More »

Consider a two player coin game where each player gets turn one by one. There is a row of even number of coins, and a… Read More »