## Maximum and minimum isolated vertices in a graph

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 »

- Optimal Strategy for a Game | DP-31
- Combinatorial Game Theory | Set 2 (Game of Nim)
- Combinatorial Game Theory | Set 1 (Introduction)
- Choice of Area
- Minimax Algorithm in Game Theory | Set 1 (Introduction)
- Minimax Algorithm in Game Theory | Set 4 (Alpha-Beta Pruning)
- Implementation of Tic-Tac-Toe game
- Minimax Algorithm in Game Theory | Set 3 (Tic-Tac-Toe AI - Finding optimal move)
- Combinatorial Game Theory | Set 3 (Grundy Numbers/Nimbers and Mex)
- Coin game of two corners (Greedy Approach)
- Find the winner in nim-game
- Combinatorial Game Theory | Set 4 (Sprague - Grundy Theorem)
- Variation in Nim Game
- Minimax Algorithm in Game Theory | Set 2 (Introduction to Evaluation Function)
- Game of N stones where each player can remove 1, 3 or 4
- Maximum and minimum isolated vertices in a graph
- Minimax Algorithm in Game Theory | Set 5 (Zobrist Hashing)
- Game of Nim with removal of one stone allowed
- Game of replacing array elements
- Josephus Problem | (Iterative Solution)
- The prisoner's dilemma in Game theory
- Check if the game is valid or not

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 »

There are N Children are seated on N chairs arranged around a circle. The chairs are numbered from 1 to N. The game starts going… Read More »

You are given an array A[] of n-elements. There are two players Alice and Bob. A Player can choose any of element from array and… Read More »

In Game of Nim, two players take turns removing objects from heaps or the pile of stones. Suppose two players A and B are playing… Read More »

Three players P1, P2 and P3 are playing a game. But at a time only two players can play the game, so they decided, at… Read More »

Prerequisites: Sprague Gruncy theorem Grundy Numbers Nim is a famous game in which two players take turns removing items from distinct piles. During each turn,… Read More »

There are two players A and B who are interested in playing a game of numbers. In each move a player pick two distinct number,… Read More »

Two players are playing a game with n stones where player 1 always plays first. The two players move in alternating turns and plays optimally.… Read More »

Two members of a criminal gang are arrested and imprisoned. Each prisoner is in solitary confinement with no means of communicating with the other. The… Read More »

Consider a game, in which you have two types of powers, A and B and there are 3 types of Areas X, Y and Z.… Read More »

Previous posts on this topic : Minimax Algorithm in Game Theory, Evaluation Function in Game Theory, Tic-Tac-Toe AI – Finding optimal move, Alpha-Beta Pruning. Zobrist… Read More »

Prerequisites: Minimax Algorithm in Game Theory, Evaluation Function in Game Theory Alpha-Beta pruning is not actually a new algorithm, rather an optimization technique for minimax… Read More »

Rules of the Game The game is to be played between two people (in this program between HUMAN and COMPUTER). One of the player chooses… Read More »

Prerequisites: Minimax Algorithm in Game Theory, Evaluation Function in Game Theory Let us combine what we have learnt so far about minimax and evaluation function… Read More »