1. IR @ Alliance University
  2. Journal Articles Archive
  3. Articles to be qced
Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7648
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKevin J. Mcgown-
dc.contributor.authorAnanda Leininger-
dc.date.accessioned2024-02-27T06:20:43Z-
dc.date.available2024-02-27T06:20:43Z-
dc.date.issued2005-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7648-
dc.description.abstractCan 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.-
dc.publisherBulletin of the Institute of Combinatorics and Its Applications-
dc.titleKnights Tour on Boards with Holes-
dc.volVol 45-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
Knight's Tour on Boards with Holes.pdf
  Restricted Access		6.94 MBAdobe PDFView/Open Request a copy
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.