Various pushing methods on grid graphs

This thesis describes algorithms for determining if a grid of switches can be turned into all-off state from any initial configuration by various methods of activation operation (push). Among these push methods, besides the regular "+" push, "+" push with no center, "X" push, "X" push with no center, and a "V"-typed unbalanced push are studied. The research methods used in this work are mainly linear algebra and algorithm analysis. Results obtained include that the grid m x n is completely solvable with push "+" no center, if and only if co-prime (m+1, n+1).

Name thesis:degree_name

MS

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Lane Department of Computer Science and Electrical Engineering

Year dc:date.available

1999

Author dc:creator

• Wang, Jiaxin

Contributors dc:contributor

• Frances L. VanScoy.

• Computer science
• Mathematics

Identifier

https://researchrepository.wvu.edu/etd/997

OAI identifier oai:identifier

oai:researchrepository.wvu.edu:etd-2000