DIR Return Create A Forum - Home
---------------------------------------------------------
knight tours
HTML https://knighttours.createaforum.com
---------------------------------------------------------
*****************************************************
DIR Return to: recent papers
*****************************************************
#Post#: 10--------------------------------------------------
google scholar since 2019 for "knight tours"
By: gsgs Date: March 15, 2023, 8:18 am
---------------------------------------------------------
Anmelden
Artikel
Ungefähr 35 Ergebnisse (0,09 Sek.)
Beliebige Zeit
Seit 2023
Seit 2022
Seit 2019
Zeitraum wählen...
Nach Relevanz sortieren
Nach Datum sortieren
Beliebige Sprache
Seiten auf Deutsch
Alle Typen
Übersichtsarbeiten
Knight tour patterns: Novel handcrafted feature descriptors for
facial expression recognition
MN Kartheek, R Madhuri, MVNK Prasad… - Computer Analysis of …,
2021 - Springer
… of Knight tours depend on the position at which Knight starts,
if it starts at the position (1, 1),
then 304 Knight tours are possible. If it starts at position (3,
3), then 64 Knight tours are …
Speichern Zitieren Zitiert von: 2 Ähnliche Artikel Alle 2
Versionen
[PDF] arxiv.org
Leaper Tours
N Beluhov - arXiv preprint arXiv:2104.13017, 2021 - arxiv.org
… Since then, knight tours have given rise to a vast amount of
literature. We point readers to
George Jelliss’s [13] for an in-depth discussion of the subject
as well as a comprehensive …
Speichern Zitieren Ähnliche Artikel Alle 4 Versionen
[PDF] mayhematics.com
[PDF] Chronology & Bibliography of Tours
GP Jelliss - 2019 - mayhematics.com
… Enumerates knight tours of 10-cell shaped boards without holes
1949: AWS Baillie FCR ¶8531.
Collage of the 10-cell tours witihn a 13×13 frame. 1949: TR
Dawson FCR Nov 1949 p.68…
Speichern Zitieren Ähnliche Artikel
[PDF] alsaeeduni.net
A Robust Audio Steganography Method Using Partial Knight Tour
for Concealing Messages of Text and Image
A Alqobaty - مجلة
جامعة
السعيد
للعلوم
الانسانية
و
التطبيقية,
2019‎ - journal.alsaeeduni.net
The rapid growth in transfer of data over the Internet realized
the need to secured data
transmission. Moreover, there is a need to send message that
contains a text and image. The …
Speichern Zitieren
Secure communication in Internet of Things devices using
steganography
MK Bhatia, C Komalavalli, C Laroiya - … Networks for Industrial
…, 2022 - taylorfrancis.com
… , and solutions of all the closed Knight Tours starting from
different positions in 4*4 chessboards
are saved. Then, 8-pixels corresponding to two closed knight
tours in 4*4 image block is …
Speichern Zitieren Ähnliche Artikel Alle 2 Versionen
[HTML] almerja.net
[HTML] s-Cluster
W Ahrens - 2022 - almerja.net
… is allowed to move as far as possible until it comes to a
blind alley, at which point it backs
up some number of steps and then tries a different path) can be
used to find knight's tours, but …
Speichern Zitieren Ähnliche Artikel
[HTML] sciencedirect.com
[HTML] Taming the knight's tour: Minimizing turns and crossings
JJ Besa, T Johnson, N Mamano, MC Osegueda… - Theoretical
Computer …, 2022 - Elsevier
… We introduce two new metrics of “simplicity” for knight's
tours: the number of turns and the
number of crossings. We give a novel algorithm that produces
tours with 9.25 n + O ( 1 ) turns …
Speichern Zitieren Ähnliche Artikel Alle 10 Versionen
An Algorithm of Generalized Knight's Tour Problem Based on Path
Joint
Z Long-fu, W Ying-long, B Sen… - 2019 IEEE 4th …, 2019 -
ieeexplore.ieee.org
… A simple recursive backtracking algorithm for knight's tours
puzzle on standard 8×8
chessboard was proposed by Debajyoti Ghosh[7]. A divide-conquer
algorithm was proposed by …
Speichern Zitieren Ähnliche Artikel
[PDF] sciencedirect.com
Two dependent probabilistic chip-collecting games
J Harrington, K Karhadkar, M Kohutka… - Discrete Applied …, 2021
- Elsevier
… knight tours on rectangular grids and Watkins and Hoenigman
[10] considered knight tours
on … to [2], [4], [5], [7] for other examples of random walks
and knight tours on various surfaces. …
Speichern Zitieren Zitiert von: 1 Ähnliche Artikel Alle 2
Versionen
[PDF] pharmasug.org
[PDF] The Knight's Tour in 3-Dimensional Chess
SM Gerlach - SAS Global Forum, 2019 - pharmasug.org
… Note: Knight Tours in this paper include … Display of two
Knight Tours generated by
Solution #1. … APPENDIX B – TWO KNIGHT TOURS USING A SINGLE
CHESS BOARD …
Speichern Zitieren Zitiert von: 1 Ähnliche Artikel Alle 3
Versionen
1 2 3 4
Weiter
HilfeDatenschutzerklärungNutzungsbedingungen
Anmelden
Artikel
Seite 2 von ungefähr 36 Ergebnissen (0,06 Sek.)
Beliebige Zeit
Seit 2023
Seit 2022
Seit 2019
Zeitraum wählen...
Nach Relevanz sortieren
Nach Datum sortieren
Beliebige Sprache
Seiten auf Deutsch
Alle Typen
Übersichtsarbeiten
[HTML] springer.com
[HTML] Photovoltaic array reconfiguration under partial shading
conditions for maximum power extraction via knight's tour
technique
S Rezazadeh, A Moradzadeh, K Pourhossein… - Journal of Ambient
…, 2022 - Springer
… Figures 2 and 3 show examples of closed and open Knight's
tours that have legal movement,
respectively. It should be noted that our goal in this paper is
not just to use closed or open …
Speichern Zitieren Zitiert von: 7 Ähnliche Artikel Alle 3
Versionen
[ZITATION] Using the Optgraph Procedure to Construct Closed
Knight's Tours on Standard and Variant Chessboards
J DeMaio, MS Alam
Speichern Zitieren Ähnliche Artikel
The 2018 Joint Mathematics Meetings exhibition of mathematical
art
DG Burkholder - Journal of Mathematics and the Arts, 2019 -
Taylor & Francis
… Of course, now that we’re interpreting these chessboards as
knight tours, we see that the
line drawings show us the knight's path and they validate our
conjectured path. …
Speichern Zitieren Ähnliche Artikel Alle 3 Versionen
Mathematical Mosaics.
B Hayes - American Scientist, 2020 - go.gale.com
… Bosch goes on to present a gallery of other graphic fantasies
generated by various
optimizing procedures, applying them to knots, knight's tours on
the chessboard, labyrinths, and …
Speichern Zitieren Ähnliche Artikel Alle 2 Versionen
[PDF] arxiv.org
Shannon capacity, Chess, DNA and Umbrellas
O Knill - arXiv preprint arXiv:2108.04994, 2021 - arxiv.org
… Are there closed knight tours for example or problems like
placing 8 non-interacting queens
on a 8×8 board. An other interesting problem is to place
non-interacting super queens, …
Speichern Zitieren Ähnliche Artikel Alle 2 Versionen
[PDF] iacr.org
Lattice-Face Key Infrastructure (LFKI) for Quantum Resistant
Computing
JJ Umezurike - Cryptology ePrint Archive, 2019 - eprint.iacr.org
… The understanding of Euler, Hamiltonian cycle and lattice
basis paved the way in drawing
the relationship needed to harmonize the open knight tours (OKT)
in the genre of Hamilton’ …
Speichern Zitieren Ähnliche Artikel Alle 4 Versionen
Backtracking
R Uehara, R Uehara - First Course in Algorithms Through Puzzles,
2019 - Springer
In this chapter, we learn the technique called backtracking
backtracking . Backtracking is a
systematic method of trial and error. In short, it is an
approach that tests all possible choices, …
Speichern Zitieren Ähnliche Artikel
[PDF] dergipark.org.tr
The Effect of Scoring Factor for Leiden Algorithm
S GÜLDAL - Afyon Kocatepe Üniversitesi Fen Ve Mühendislik …,
2021 - dergipark.org.tr
Leiden algorithm is a widely utilized algorithm to cluster
network graphs. It divides the specified
network into smaller clusters. The clusters are relatively dense
networks of vertices. In …
Speichern Zitieren Ähnliche Artikel Alle 2 Versionen
[PDF] archive.org
[PDF] Afyon Kocatepe Üniversitesi Fen ve Mühendislik Bilimleri
Dergisi
S GÜLDAL - scholar.archive.org
Öz Leiden algoritması, çizgeleri kümelemek için yaygın
olarak kullanılan bir algoritmadır ve
belirtilen çizgeyi daha küçük kümelere böler. Bu kümeler,
nispeten yoğun düğüm çizgeleridir…
Speichern Zitieren Ähnliche Artikel
[PDF] dergipark.org.tr
IDENTIFICATION OF KNIGHTS'RELATIONS FOR 5× 5 KNIGHT GRAPH BY
MODULARITY
S Güldal - Adıyaman Üniversitesi Mühendislik Bilimleri
Dergisi, 2020 - dergipark.org.tr
Modularity is a widely utilized technic to analyze graphs. The
modularity divides the specified
network into relational clusters. The clusters highlight the
shared properties between the …
Speichern Zitieren Zitiert von: 2 Ähnliche Artikel Alle 2
Versionen
Zurück
1 2 3 4
Weiter
HilfeDatenschutzerklärungNutzungsbedingungen
Anmelden
Artikel
Seite 3 von ungefähr 37 Ergebnissen (0,05 Sek.)
Beliebige Zeit
Seit 2023
Seit 2022
Seit 2019
Zeitraum wählen...
Nach Relevanz sortieren
Nach Datum sortieren
Beliebige Sprache
Seiten auf Deutsch
Alle Typen
Übersichtsarbeiten
[PDF] sciendo.com
Diameter-separation of chessboard graphs
D Chatham - Recreational Mathematics Magazine - sciendo.com
… As other authors have done with problems like the n queens
problem and knight tours [Wat04],
we express our problem in terms of graph theory, starting with
some basic terms. Let G = (…
Speichern Zitieren Ähnliche Artikel Alle 2 Versionen
[PDF] dergipark.org.tr
4× 4 Knight's Graph Analysis by Modularity A Knight Graph
Application
S GÜLDAL - Turkish Journal of Science and Technology, 2021 -
dergipark.org.tr
Modularity is a well-known technic to analyze graphs of
datasets. The modularity divides the
network into meaningful clusters. The clusters present the
existence of shared properties …
Speichern Zitieren Ähnliche Artikel Alle 3 Versionen
[PDF] dergipark.org.tr
UNSUPERVISED MACHINE LEARNING ALGORITHM TO SOLVE KNIGHT COVERING
PROBLEM FOR 6 BY 6 BOARD
S GÜLDAL - Adıyaman Üniversitesi Mühendislik Bilimleri
Dergisi - dergipark.org.tr
Modularity is a well-known method as a machine-learning
algorithm to extract information
from graphs. The modularity, in essence, divides the considered
network into smaller clusters. …
Speichern Zitieren Ähnliche Artikel Alle 2 Versionen
Solving Knights Covering Problem by a Hybrid Algorithm
S Güldal, MM Tanik, MM Lipscomb - 2019 SoutheastCon, 2019 -
ieeexplore.ieee.org
There are problems which do not have analytical solutions and
require algorithms (such as
Backtracking) that use brute force. The time complexity of these
algorithms is polynomial, so …
Speichern Zitieren Zitiert von: 8 Ähnliche Artikel
[PDF] arxiv.org
Operational framework for recent advances in backtracking search
optimisation algorithm: A systematic review and performance
evaluation
BA Hassan, TA Rashid - Applied Mathematics and Computation, 2020
- Elsevier
Backtracking search optimisation algorithm (BSA) is a commonly
used meta-heuristic optimisation
algorithm and was proposed by Civicioglu in 2013. When it was
first used, it exhibited …
Speichern Zitieren Zitiert von: 53 Ähnliche Artikel Alle 6
Versionen
[HTML] cyberleninka.ru
[HTML]
Моделиров&
#1072;ние
перемещен&
#1080;я
объекта
сложной
неизменяе&
#1084;ой
конфигура&
#1094;ии
в
ограничен&
#1085;ом
пространс&
#1090;ве
ЭА
Акбаров,
ЕВ
Калашнико&
#1074;
- …
областног&
#1086;
университ&
#1077;та.
Серия …, 2019 - cyberleninka.ru
Анализиру&
#1077;тся
задача
перемещен&
#1080;я
и
встраиван&
#1080;я
объекта
неизменяе&
#1084;ой
конфигура&
#1094;ии
в
ограничен&
#1085;ом
пространс&
#1090;ве.
Строится
алгоритм и
программа,
имитирующ&
#1072;я
…
Speichern Zitieren Ähnliche Artikel Alle 4 Versionen
[PDF] dergipark.org.tr
Unsupervised Machine Learning Algorithms to Find 3-KCP Solution:
Modularity, Clique Percolation, Spectral, Centrality, and
Hierarchical Clustering
S GÜLDAL - Adıyaman Üniversitesi Mühendislik Bilimleri
Dergisi, 2021 - dergipark.org.tr
Unsupervised learning algorithms are used in many engineering
applications since they
extract information by the minimum human interaction. Modularity
is one of the well known …
Speichern Zitieren Zitiert von: 1 Ähnliche Artikel
[PDF] adiyaman.edu.tr
6'ya 6 tahta üzerinde at kaplama problemini çözmek için
denetimsiz makine öğrenme algoritması
S Güldal - 2021 - dspace.adiyaman.edu.tr
Modularity is a well-known method as a machine-learning
algorithm to extract information
from graphs. The modularity, in essence, divides the considered
network into smaller clusters. …
Speichern Zitieren Ähnliche Artikel Alle 2 Versionen
[HTML] springer.com
[HTML] Minimal block knight's tour and edge with lsb pixel
replacement based encrypted image steganography
BS Shashikiran, K Shaila, KR Venugopal - SN Computer Science,
2021 - Springer
… Ghosh D, Bhaduri U (2017) A simple recursive backtracking
algorithm for knight's tours
puzzle on standard 8 × 8 chessboard. In: 2017 international
conference on advances in …
Speichern Zitieren Zitiert von: 6 Ähnliche Artikel Alle 4
Versionen
[PDF] researchgate.net
[PDF] New cryptographic system of romanized Arabic text based on
modified playfiar
D Al-Nasrawi - Journal of Engineering and Applied Sciences, 2019
- researchgate.net
One of the most spoken language in the world today is Arabic
language. The other hand the
development of applied e-Government in most fields, required
using of internet, many …
Speichern Zitieren Zitiert von: 3 Ähnliche Artikel Alle 2
Versionen
Zurück
1 2 3 4
Weiter
HilfeDatenschutzerklärungNutzungsbedingungen
Anmelden
Artikel
Seite 4 von 37 Ergebnissen (0,07 Sek.)
Beliebige Zeit
Seit 2023
Seit 2022
Seit 2019
Zeitraum wählen...
Nach Relevanz sortieren
Nach Datum sortieren
Beliebige Sprache
Seiten auf Deutsch
Alle Typen
Übersichtsarbeiten
Novel Shade Dispersion Techniques for Reconfiguration of
Partially Shaded Photovoltaic Arrays
RDA Raj, KA Naik - Smart Grids and Sustainable Energy, 2023 -
Springer
The photovoltaic (PV) arrays are inevitably subjected to partial
shading (PS) conditions that
highly limit the output. To mitigate these effects, various
reconfiguration procedures have …
Speichern Zitieren
[PDF] adiyaman.edu.tr
3-kcp çözüm bulmak için denetimsiz öğrenme
algoritması: modülerlik, klik süzme, spektral, merkeziyet
ve hiyerarşik kümeleme
S Gürdal - 2021 - dspace.adiyaman.edu.tr
Denetimsiz öğrenme algoritmaları, bilgiyi minimum
insan etkileşimi ile çıkardıkları için
birçok
mühendislik uygulamasında kullanılırlar.
Modülerlik verileri sınıflandırmak için iyi
bilinen …
Speichern Zitieren Ähnliche Artikel
[PDF] academia.edu
[PDF]
ГЕОМЕТРИЈ&
#1040;
НА
ШАХОВСКОЈ
ТАБЛИ
М
Живановић
- MAT-KOL (Banja Luka), Matematicki Kolokvijum, 2019 -
academia.edu
148 their research, these issues are primarily focused on
combinatorics, geometry, algebra,
cybernetics, programming, and other mathematical disciplines.
This paper will give an …
Speichern Zitieren Ähnliche Artikel Alle 3 Versionen
[BUCH] Too Far to Walk: A Novel
J Hersey - 2019 - books.google.com
… Now starting from his position between the bishop and the
rook, that's the number one, the
knight tours the board, never touching the same square twice.
(Breed's hand was jumping …
Speichern Zitieren Zitiert von: 9 Ähnliche Artikel Alle 2
Versionen
[PDF] theses.cz
[PDF] Hamiltonovské grafy
R Krátký - Diplomová práce. Hradec Králové: Univerzita Hradec …,
2020 - theses.cz
The Knight’s tour, a problem that has been dealt with by various
mathematicians in past
centuries, is a popular task of recreational mathematics. These
include examples of the general …
Speichern Zitieren Zitiert von: 1 Ähnliche Artikel Alle 2
Versionen
[BUCH] Knotted doughnuts and other mathematical entertainments
M Gardner - 2020 - books.google.com
Martin Gardner's Mathematical Games columns in Scientific
American inspired and entertained
several generations of mathematicians and scientists. Gardner in
his crystal-clear prose …
Speichern Zitieren Zitiert von: 150 Ähnliche Artikel Alle 2
Versionen
[PDF] academia.edu
[BUCH] First Course in Algorithms Through Puzzles
R Uehara - 2019 - Springer
This book is an introduction to algorithms. What is an
algorithm? In short,“algorithm” means “a
way of solving a problem.” When people encounter a problem, the
approach to solving it …
Speichern Zitieren Zitiert von: 3 Ähnliche Artikel Alle 6
Versionen
Zurück
1 2 3 4
HilfeDatenschutzerklärungNutzungsbedingungen
#Post#: 37--------------------------------------------------
Re: google scholar since 2019 for "knight tours"
By: gsgs Date: March 25, 2025, 11:57 pm
---------------------------------------------------------
Parberry 2020 paper :
HTML https://arxiv.org/pdf/2001.06044
Tourneys and the Fast Generation and Obfuscation of Closed
Knight's Tours
Abstract :
New algorithms for generating closed knight’s tours are obtained
by generating a vertex-disjoint cycle cover of the knight’s
graph
(called "tourney") and joining the resulting cycles.
It is shown experimentally that these algorithms are
significantly
faster in practice than previous methods.
A fast obfuscation algorithm for closed knight’s tours that
obscures
obvious artifacts created by their method of generation is also
given,
along with visual and statistical evidence of its efficacy.
-----------------------------------------
make the SAT-instance, whose exactly-one-clauses are doubled
knight board-squares (directed, in and out) and whose variables
are the directed knight-moves, each variable going into the two
clauses
of its two endpoints.
Then tourneys are the solutions of this SAT-converted
exact-cover-problem.
Exclude directed cycles of length 2 and randomly permute
variables
and clauses , so to get a random tourney and avoid patterns.
The cnf-instance has 79MB,518160 variables,131072
exactly-one-clauses,
3988816 clauses in total with "pairwise" encoding of
exactly-one-clauses.
The currently best SAT-solver kissat 4.0 needs 49000s to
generate
a 256x256 tourney,
The solver clasp on 4 threads needs 1300s.
Using Pandurangan's simple randomized method from 2005 it takes
only 5s.
For 2000x2000 it takes 8 hours to make a random tourney
(
HTML http://magictour.free.fr/cycok.c)
and my simple cycle-joining program tages another 2 hours to
make
a knight's tour from it.
HTML https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=5afaaf01b9c67893621471dc90b5161e09448794
figure 2
*****************************************************