Relevant bibliographies by topics / Knight tour

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Knight tour'

Author: Grafiati
Published: 4 June 2025
Last updated: 15 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Knight tour.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Knight tour"

1

Refan Rahmat Fauzi, Mochammad Taufik Faturrohman, and Raihan Samhari. "Penggunaan Algoritma Backtracking Pada Permainan Knight's Tour Dengan Membandingkan Algoritma BFS Dan DFS." Jurnal Ilmiah Teknik Informatika dan Komunikasi 3, no. 2 (2023): 168–73. http://dx.doi.org/10.55606/juitik.v3i2.512.

Full text
Abstract:
Knight is one type of pawn in the game of chess. By using a strategy to play chess pieces, the rules of the Knight's Tour are formed. Knight's Tour is a math puzzle where we have to move the piece by forming the letter "L" exactly once on the game board. Progression in the game results in different types of moves in the Knight and solutions provided. The goal is to get every possible move on the Knight in completing the game optimally. There are various algorithm methods that have been developed to solve this game, one of which is the Backtracking algorithm. And in this study, researchers prod
APA, Harvard, Vancouver, ISO, and other styles
2

Ripà, Marco. "Proving the existence of Euclidean knight’s tours on n × n × ⋯ × n chessboards for n < 4." Notes on Number Theory and Discrete Mathematics 30, no. 1 (2024): 20–33. http://dx.doi.org/10.7546/nntdm.2024.30.1.20-33.

Full text
Abstract:
The Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set. In the present, we provide a 5-dimensional alternative to the well-known statement that it is not ever possible for a knight to visit once every vertex of $C(3,k):=\{\underbrace{\{0,1,2\} \times \{0,1,2\}\times \cdots \times \{0,1,2\}}_\textrm{\textit{k}-times}\}$ by performing a sequence of $3^k-1$ jumps of standard length, since the most accurate answer to the original question actually depends on which mathemati
APA, Harvard, Vancouver, ISO, and other styles
3

Romanuke, Vadim, Svitlana Yaremko, Olena Kuzmina, and Hanna Yehoshyna. "Data scrambler knight tour algorithm." System research and information technologies, no. 3 (September 28, 2024): 44–63. http://dx.doi.org/10.20535/srit.2308-8893.2024.3.03.

Full text
Abstract:
Nowadays, data scrambling remains a vital technique to protect sensitive information by shuffling it in a way that makes it difficult to decipher or reverse-engineer while still maintaining its usability for legitimate purposes. As manipulating the usability of the scrambled data remains a challenge on the background of risking losing data and getting them re-identified by attackers, scrambling and descrambling should be accomplished faster by not increasing data loss and re-identification risks. A scrambling algorithm must have a linear time complexity, still shuffling the data to minimize th
APA, Harvard, Vancouver, ISO, and other styles
4

Bullington, Grady, Linda Eroh, Steven J. Winters, and Garry L. Johns. "Knight’s Tours on Rectangular Chessboards Using External Squares." Journal of Discrete Mathematics 2014 (December 9, 2014): 1–9. http://dx.doi.org/10.1155/2014/210892.

Full text
Abstract:
The classic puzzle of finding a closed knight’s tour on a chessboard consists of moving a knight from square to square in such a way that it lands on every square once and returns to its starting point. The 8 × 8 chessboard can easily be extended to rectangular boards, and in 1991, A. Schwenk characterized all rectangular boards that have a closed knight’s tour. More recently, Demaio and Hippchen investigated the impossible boards and determined the fewest number of squares that must be removed from a rectangular board so that the remaining board has a closed knight’s tour. In this paper we de
APA, Harvard, Vancouver, ISO, and other styles
5

Mohamed, Fatma Akram. "PVD with knight tour algorithm." Benha Journal of Applied Sciences 9, no. 5 (2024): 97–103. http://dx.doi.org/10.21608/bjas.2024.269705.1329.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Srichote, Wasupol, Ratinan Boonklurb, and Sirirat Singhun. "Closed Knight’s Tours on (m,n,r)-Ringboards." Symmetry 12, no. 8 (2020): 1217. http://dx.doi.org/10.3390/sym12081217.

Full text
Abstract:
A (legal) knight’s move is the result of moving the knight two squares horizontally or vertically on the board and then turning and moving one square in the perpendicular direction. A closed knight’s tour is a knight’s move that visits every square on a given chessboard exactly once and returns to its start square. A closed knight’s tour and its variations are studied widely over the rectangular chessboard or a three-dimensional rectangular box. For m,n&gt;2r, an (m,n,r)-ringboard or (m,n,r)-annulus-board is defined to be an m×n chessboard with the middle part missing and the rim contains r ro
APA, Harvard, Vancouver, ISO, and other styles
7

Centelles, Josep J., Estefania Moreno, and Pedro Ramon De Atauri. "Use of Several Grids in the Knight Tour’s Game to Find Shorter or Longer Biochemistry’s Sentences." International Journal on Engineering, Science and Technology 5, no. 1 (2023): 74–88. http://dx.doi.org/10.46328/ijonest.147.

Full text
Abstract:
Knight tour is a mathematical problem that was first solved by Leonhard Euler (1707-1785). The problem consists in finding if it is possible that the knight piece of chess can tour through all the boxes of a chess grid, passing only once through each box. Bishop piece can only move to diagonal boxes of one color, and pawns can only move in one column. It can be easily seen that king, queen and rook can move through all the boxes. But it was not clear that the knight could move all through. Euler found several solutions for the 8x8 grid, and he numbered all the boxes of the grid in the order th
APA, Harvard, Vancouver, ISO, and other styles
8

Oraby, Emaan Oudha, and Rafeef Mohammed Hamza. "A Modified KLEIN Encryption-based Knight Tour for Image Encryption." Journal of Applied Engineering and Technological Science (JAETS) 5, no. 1 (2023): 268–78. http://dx.doi.org/10.37385/jaets.v5i1.3296.

Full text
Abstract:
The security considerations should be balanced with the specific use case and potential risks associated with using lightweight encryption. The security offered by lighter encryption algorithms could not be as high as that offered by heavier encryption techniques. In this paper, a Modified KLEIN Algorithm is proposed for image encryption based on the Knight Tour movement in Chessboard. The required key generation is represented by inputting an image as a key image and then applying a specific operation based on knight tour movement to produce a key scheduled in the proposed encryption algorith
APA, Harvard, Vancouver, ISO, and other styles
9

Shakir Mahmood, Ali, Mohd Shafry Mohd Rahim, and Nur Zuraifah Syazrah Othman. "Implementation of the Binary Random Number Generator Using the Knight Tour Problem." Modern Applied Science 10, no. 4 (2016): 35. http://dx.doi.org/10.5539/mas.v10n4p35.

Full text
Abstract:
&lt;p&gt;A random number can be defined as a set of numbers produced by a numerical function, in which the next number is unpredictable and a relationship between successive occurrences is lacking. Moreover, these sequences cannot be reproduced unless the same generator function with an exact initial value is used. The design of a random number generator must overcome the previous problems of a low periodic and the capacity to reproduce the same sequence. This paper proposes the knight tour as a tool for generating pseudo random numbers. These random numbers can be use in the encryption proces
APA, Harvard, Vancouver, ISO, and other styles
10

Nie, Soo Ann, Ghazali Sulong, Rozniza Ali, and Andrew Abel. "The use of Least Significant Bit (LSB) and Knight Tour Algorithm for image steganography of cover image." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 6 (2019): 5218. http://dx.doi.org/10.11591/ijece.v9i6.pp5218-5226.

Full text
Abstract:
&lt;span lang="EN-US"&gt;Steganography is one of the method to communicate in a hidden way. In another word, steganography literally means the practice of hiding messages or information within another data. Previous studies have proposed various steganography techniques using different approaches including Least Significant Bit (LSB), Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT). However, different approaches still have its own weaknesses. Therefore image stenography using Knight Tour Algorithm with Least Significant Bit (LSB) technique is presented. The main objective
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Knight tour"

1

Henri, Delphine. "Production et consommation textiles à Tours aux XVe et XVIe siecles : Approche archéologique." Thesis, Tours, 2015. http://www.theses.fr/2015TOUR2019/document.

Full text
Abstract:
La découverte à Tours de plus de six mille fragments de textiles dans la même fosse, à l’extérieur du rempart qui longe la berge de la Loire (site 69 « place Anatole France »), a permis d’étudier tout le processus du travail textile, du fil au rejet. La quasi-totalité des éléments examinés sont en drap de laine, grande industrie en Europe aux 15e – 16e siècles. Tout comme pour les soieries, moins bien conservées, l’étude s’est attachée à déterminer s’il s’agit de produits tourangeaux. Le traitement des draps de laine, augmentant leur résistance, a permis l’observation des formes, dont quelques
APA, Harvard, Vancouver, ISO, and other styles
2

Repík, Tomáš. "Evoluční návrh využívající gramatickou evoluci." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363805.

Full text
Abstract:
p, li { white-space: pre-wrap; } Evoluce v přírodě slouží jako zdroj inspirace pro tuto práci . Základní myšlenkou je využití generativní síly gramatik v kombinaci s evolučním přístupem . Nabyté znalosti jsou aplikovány na hledání strategií chování v rozmanitých prostředích . Stromy chování jsou modelem , který bývá běžně použit na řízení rozhodování různých umělých inteligencí . Tato práce se zabývá hledáním stromů chování , které budou řídit jedince řešící nasledující dva problémy : upravenou verzi problému cesty koněm šachovnicí a hraní hry Pirátské kostky . Při hledání strategie hráče kost
APA, Harvard, Vancouver, ISO, and other styles
3

YU, JIN-GUAN, and 余金全. "On the Problems of N-queen and Finding the Knight''s Tour." Thesis, 1988. http://ndltd.ncl.edu.tw/handle/17957027963129182943.

Full text
Abstract:
碩士<br>國立成功大學<br>應用數學研究所<br>76<br>The problems of Knight''s Tour and N-Queen are well known. Traditionally these problems are solved first by moving (placing) the knight (or Queen) at random then the technique of backtracking is applied when no further moves (placing) are allowed. The time complexity of using this method grows almost exponentially. As n becomes large, these problems are almost impossibly solved. Therefore, in this paper we present some intelligent methods without backtracking to solve both the Knight-tour and N-Queen problems for most cases of N.
APA, Harvard, Vancouver, ISO, and other styles
4

Chung-Liang, Wei. "Optimal Algorithms for Constructing Knight's Tours on Rectangular Chessboards." 2001. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0021-1904200711405083.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Knight tour"

1

B, Everitt E. Tour of the St. Elmo's: From the Nutmeg State to the Golden Gate. Meriden Book Bindery, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Delcroix, Henri. La tour de Montbran: L'ordre du temple. Les templiers en Bretagne. Pléboulle. Montbran. La Caillibotière. La chapelle Notre-Dame-du-Temple. La foire de Montbran. Orphie, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

author, Vissière Laurent, ed. Tous les deables d'enfer: Relations du siège de Rhodes par les Ottomans en 1480. Librairie Droz, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Prima. Official Sega Genesis: Power Tips Book, Volume 3. Prima Publishing, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Death Knight Otherworldly Tour. Davila, Fernando, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lewis, D. B. Wyndham. Book of the Knight of La Tour Landry. Kessinger Publishing, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tour-Landry, LA. The Book of the Knight of LA Tour-Landry. Ams Pr Inc, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Geoffroy de La Tour Landry. The Book of the Knight of La Tour-Landry. Adamant Media Corporation, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Book of the Knight of la Tour-Landry: Compiled for the Instruction of His Daughters. Creative Media Partners, LLC, 2022.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Book of the Knight of la Tour-Landry: Compiled for the Instruction of His Daughters. Creative Media Partners, LLC, 2022.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Knight tour"

1

Kudo, Yoshinobu. "Book of the Knight of La Tour Landry." In The Palgrave Encyclopedia of Medieval Women's Writing in the Global Middle Ages. Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-030-76219-3_54-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kartheek, Mukku Nisanth, Rapolu Madhuri, Munaga V. N. K. Prasad, and Raju Bhukya. "Knight Tour Patterns: Novel Handcrafted Feature Descriptors for Facial Expression Recognition." In Computer Analysis of Images and Patterns. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-89131-2_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Takefuji, Yoshiyasu. "Knight’s Tour Problems." In Neural Network Parallel Computing. Springer US, 1992. http://dx.doi.org/10.1007/978-1-4615-3642-0_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Golumbic, Martin Charles, and André Sainte-Laguë. "IX Knight’s tour." In The Zeroth Book of Graph Theory. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61420-1_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kiran, B. D. Parameshachari, and H. T. Panduranga. "Secure Transfer of Images Using Pixel-Level and Bit-Level Permutation Based on Knight Tour Path Scan Pattern and Henon Map." In Cognitive Informatics and Soft Computing. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-1056-1_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hingston, Philip, and Graham Kendall. "Ant Colonies Discover Knight’s Tours." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30549-1_125.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lum, Gregory C. L., and David Y. Y. Yun. "Web-Enabled 3D Game Playing for Looped Knight’s Tour." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02315-6_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Banharnsakun, Anan. "Artificial Bee Colony Algorithm for Solving the Knight’s Tour Problem." In Intelligent Computing & Optimization. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00979-3_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lu, Shengwei, and Carl Yerger. "The Existence of a Knight’s Tour on the Surface of Rectangular Boxes." In Springer Proceedings in Mathematics & Statistics. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-62166-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Firstein, Michael, Anja Fischer, and Philipp Hungerländer. "Closed Almost Knight’s Tours on 2D and 3D Chessboards." In Operations Research Proceedings. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89920-6_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Knight tour"

1

Fukui, Masanori, Zhixin Shen, Zhejun Liu, and Tomoyuki Takami. "Floor Exertainment with Knight Tour Creator." In 2017 Nicograph International (NicoInt). IEEE, 2017. http://dx.doi.org/10.1109/nicoint.2017.17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cao, Yuqiang, Hui Guo, and Weiguo Gong. "A algorithm to generate the pseudorandom sequence based on knight-tour." In 2016 IEEE International Conference on Signal and Image Processing (ICSIP). IEEE, 2016. http://dx.doi.org/10.1109/siprocess.2016.7888283.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hasoon, Jamal Nasir, Ali Hussein Fadel, Rasha Subhi Hameed, and Bashar Ahmed Khalaf. "Pseudo number generation based on the knight tour in chess board." In 2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0102803.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liping, Xin, and Wang Xi. "Improved Encryption Algorithm for Digital Image of Knight Tour Based on Cell Block." In 2020 Chinese Control And Decision Conference (CCDC). IEEE, 2020. http://dx.doi.org/10.1109/ccdc49329.2020.9164366.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bai, Sen, Xiao-feng Liao, Xiao-hong Qu, and Yi-jun Liu. "Generalized Knight's Tour Problem and Its Solutions Algorithm." In 2006 International Conference on Computational Intelligence and Security. IEEE, 2006. http://dx.doi.org/10.1109/iccias.2006.294200.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Karpate, Sarang, and Amit Barve. "A Novel Encryption Algorithm Using Chaotic Lorenz Attractor and Knights Tour." In ICCCT '15: Sixth International Conference on Computer and Communication Technology 2015. ACM, 2015. http://dx.doi.org/10.1145/2818567.2818667.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bisht, Kanchan, and Maroti Deshmukh. "Encryption algorithm based on knight’s tour and n-neighbourhood addition." In 2020 7th International Conference on Signal Processing and Integrated Networks (SPIN). IEEE, 2020. http://dx.doi.org/10.1109/spin48934.2020.9071013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bai, Sen, Gui-Bin Zhu, and Jian Huang. "An Intelligent Algorithm for the (1,2,2)-Generalized Knight's Tour Problem." In 2013 Ninth International Conference on Computational Intelligence and Security (CIS). IEEE, 2013. http://dx.doi.org/10.1109/cis.2013.129.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Long-fu, Zhou, Wang Ying-long, Bai Sen, and Gong Qu. "An Algorithm of Generalized Knight’s Tour Problem Based on Path Joint." In 2019 IEEE 4th International Conference on Image, Vision and Computing (ICIVC). IEEE, 2019. http://dx.doi.org/10.1109/icivc47709.2019.8980986.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Adnan, Norsabihah, Nur Hafizah Ghazali, Rusnida Romli, et al. "Enhancing watermark robustness in medical images through knight’s tour-based algorithm." In FOURTH INTERNATIONAL CONFERENCE ON ADVANCES IN PHYSICAL SCIENCES AND MATERIALS: ICAPSM 2023. AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0216563.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Knight tour"

1

Shufelt, Jefferey A., and Hans J. Berliner. Generating Knight's Tours Without Backtracking from Errors. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada266807.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Knight tour' for particular source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography