Article Details

Version for online viewing      Version for printing

Independence and domination on shogiboard graphs
Doug Chatham
Given a (symmetrically-moving) piece from a chesslike game, such as shogi, and an n×n board, we can form a graph with a vertex for each square and an edge between two vertices if the piece can move from one vertex to the other. We consider two pieces from shogi: the dragon king, which moves like a rook and king from chess, and the dragon horse, which moves like a bishop and rook from chess.  We show that the independence number for the dragon kings graph equals the independence number for the queens graph.  We show that the (independent) domination number of the dragon kings graph is n-2 for 4≤n≤6 and n-3 for n≥7.  For the dragon horses graph, we show that the independence number is 2n-3 for n≥5, the domination number is at most n-1 for n≥4, and the independent domination number is at most n for n≥5.
shogi, n-queens problem, combinatorics
Published: 2018/01/11
Author Details
Doug Chatham
Morehead State University, Department of Mathematics and Physics

     About us | Editorial Board | To the authors | Contact us