Skip to content

This contains the code for our paper: Domineering games with minimal number of moves.

License

Notifications You must be signed in to change notification settings

RohanKarthikeyan/Domineering

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Domineering games with minimal number of moves

The paper is here.

What is domineering?

Domineering is a 2-player (combinatorial) game played on a rectangular board (of any size). Play consists of the two players alternately placing a tile (domino) on adjacent empty squares; Left places vertically and Right places horizontally. The game ends when the player whose turn it is cannot place a piece; and the player who cannot place loses - this is the normal play condition.

☑️ What did we do?

We find the minimum number of moves for a game of domineering to end on all rectangular boards up to size . For this, we used the Maple codes ⤴️ and the analysis described on Page 3 of our paper to find the answers.


S.D.G.

About

This contains the code for our paper: Domineering games with minimal number of moves.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages