Alliance University, Bengaluru
Institutional Repository
Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7648| Title: | Knights Tour on Boards with Holes |
| Authors: | Kevin J. Mcgown Ananda Leininger |
| Issue Date: | 2005 |
| Publisher: | Bulletin of the Institute of Combinatorics and Its Applications |
| Abstract: | Can a knight using legal moves visit every square on a chessboar<l exactly once? This is a classical problem and it is known which rectangular chessboards admit a knight's tour. Discovering whether a chessboard has a knight's tour is more difficult if some squares are removed from the chessboard. Vie show that this problem is NP-complete by reduction from the Hamiltonian path problem for grid graphs. |
| URI: | http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7648 |
| Appears in Collections: | Articles to be qced |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| Knight's Tour on Boards with Holes.pdf Restricted Access | 6.94 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.