Matthew Wolff’s scientific contributions

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (1)


Table 2 :
Figure 3: Chessboard and Corresponding Universe 
Figure 4: Recomputed Rows with 1 Pawn
Independence and domination separation on chessboard graphs
  • Article
  • Full-text available

January 2008

·

1,028 Reads

·

16 Citations

Journal of Combinatorial Mathematics and Combinatorial Computing

·

·

·

[...]

·

Matthew Wolff

A legal placement of Queens is any placement of Queens on an order N chessboard in which any two attacking Queens can be separated by a Pawn. The Queens independence separation number is the minimum number of Pawns which can be placed on an N × N board to result in a separated board on which a maximum of m independent Queens can be placed. We prove that N + k Queens can be separated by k Pawns for large enough N and provide some results on the number of fundamental solutions to this problem. We also introduce separation relative to other domination-related parameters for Queens, Rooks, and Bishops.

Download

Citations (1)


... In [Cha09], given a chess piece C and a graph parameter π, the π-separation number s C (π, n, p) for C is defined as the minimum number of pawns for which some placement of those pawns on an n × n board will produce a board whose C graph has π = p. Following that pattern, we define the rooks diameter-separation number s R (diam, n, d) to be the minimum number of pawns for which some placement of those pawns on an n × n board will produce a board whose rooks graph has diameter d. ...

Reference:

Diameter-Separation of Chessboard Graphs
Independence and domination separation on chessboard graphs

Journal of Combinatorial Mathematics and Combinatorial Computing