## Determine winner of the Game by arranging balls in a row

Given the number of small and large balls N and M respectively, the task is to find which player wins if both the player X… Read More »

- Optimal Strategy for the Divisor game using Dynamic Programming
- Two player game in which a player can remove all occurrences of a number
- Expectimax Algorithm in Game Theory
- Minimum Bipartite Groups
- Largest odd divisor Game to check which player wins
- Make a palindromic string from given string
- Minimum cost to reduce the integer N to 1 as per given conditions
- Determine winner of the Game by arranging balls in a row

Given the number of small and large balls N and M respectively, the task is to find which player wins if both the player X… Read More »

Given four integers N, X, P, and Q, the task is to find the minimum cost to make N to 1 by the following two… Read More »

Two players are playing a game starting with a number n. In each turn, a player can make any one of the subsequent moves: Divide… Read More »

Two players player1 and player2 are playing a game on a given number sequence S where player1 starts first and both of them play optimally.… Read More »

Given a string S consisting of lower-case English alphabets only, we have two players playing the game. The rules are as follows: The player can… Read More »

Given an integer N and two players, A and B are playing a game. On each player’s turn, that player makes a move by subtracting… Read More »

The Expectimax search algorithm is a game theory algorithm used to maximize the expected utility. It is a variation of the Minimax algorithm. While Minimax… Read More »

Given Adjacency List representation of graph of N vertices from 1 to N, the task is to count the minimum bipartite groups of the given… Read More »

Prerequisites: Game Theory When the strategies from game theory are discussed, they are often mentioned from a player’s perspective. However, when the strategies are formed… Read More »

Problem Statement: Consider a row of n coins of values v1 . . . vn, where n is even. We play a game against an… Read More »

The article “Game Development with Unity | Introduction” introduces about Unity and how to install it. In this article, we will see how to create… Read More »

The payoff matrix of a 2 * N game consists of 2 rows and N columns. This article will discuss how to solve a 2… Read More »

The payoff matrix of an M * 2 game consists of M rows and two columns. This article will discuss how to solve an M… Read More »

Two players are playing a series of games of Rock–paper–scissors. There are a total of N games played represented by an array arr[][] where arr[i][0]… Read More »

In some of the games, it is possible to reduce the size of the payoff matrix by eliminating rows (or columns) which are dominated by… Read More »