Some New Results on King- and Queen- Graphable Words

Authors

Mike Keith

Abstract

A word (or phrase, sentence, etc.) is said to be king-graphable (KG) if each of its distinct letters can be placed on a square of an infinite chessboard such that the entire word or pharase can be spelled out by starting on the first letter and making only the moves of a chess king to get from letter to letter.

Recommended Citation

Keith, Mike (2012) "Some New Results on King- and Queen- Graphable Words," Word Ways: Vol. 45 : Iss. 2 , Article 21.
Retrieved from: https://digitalcommons.butler.edu/wordways/vol45/iss2/21