KNIGHT’S TOUR PAGE NO - 1 OF 7

BMS INSTITUTE OF TECHNOLOGY & MANAGEMENT

YELAHANKA, BENGALURU - 560064

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

PROJECT BASED LEARNING

3RD SEMESTER
2020-21

Synopsis of Subject of project work

Subject Name– Data Structures ;Code – 18CS32
Subject Name– Software engineering; Code – 18CS35
Subject Name– Discrete mathematical structures; Code – 18CS36

“Knight's tour”
Submi t ted By

STUDENT NAME USN

SHREYAS VINAYAK PATIL 1BY19CS145
T S SHASHANK 1BY19CS167
SUDIP CHAKRABORTY 1BY19CS160
VINAY KUMAR 1BY19CS181

UNDER THE GUIDANCE OF

FACULTY NAME SUBJECT
DR. SATISH KUMAR T DATA STRUCTURE AND APPLICATION
DR USHA B A SOFTWARE ENGINEERING
DR ARUNAKUMARI . N DISCRETE MATHEMATICAL STRUCTURES

BMSIT&M
DEPARTMENT OF CS&E 2020-2021
 KNIGHT’S TOUR PAGE NO - 2 OF 7

INSTITUTE VISION
To emerge as one of the finest technical institutions of higher learning,
to develop engineering professionals who are technically competent,
ethical and environment friendly for betterment of the society.

INSTITUTE MISSION
Accomplish stimulating learning environment through high quality
academic instruction, innovation and industry-institute interface.

DEPARTMENT VISION
To develop technical professionals acquainted with recent trends and
technologies of computer science to serve as valuable resource for the
nation/society.

DEPARTMENT MISSION
Facilitating and exposing the students to various learning opportunities
through dedicated academic teaching, guidance and monitoring.

PROGRAM EDUCATIONAL OBJECTIVES

1. Lead a successful career by designing, analyzing and solving
various problems in the field of Computer Science & Engineering.
2. Pursue higher studies for enduring edification.
3. Exhibit professional and team building attitude along with effective
communication.
4. Identify and provide solutions for sustainable environmental
development.

BMSIT&M
DEPARTMENT OF CS&E
2020-2021
 KNIGHT’S TOUR PAGE NO - 3 OF 7

Subject Name– Data Structures ;Code – 18CS32

Course Outcomes (COs) w.r.t this PBL

CO # CO DEFINED

ASK YOUR FACULTY ABOUT THIS

Subject Name– Software engineering; Code – 18CS35

Course Outcomes (COs) w.r.t this PBL
CO # CO DEFINED

ASK YOUR FACULTY ABOUT THIS

Subject Name– Discrete mathematical structures Code – 18CS36

Course Outcomes (COs) w.r.t this PBL
CO # CO DEFINED

ASK YOUR FACULTY ABOUT THIS

Project to Program Outcomes (PO) Mapping

Project Name: “Knight's tour”
COURSE PO PO PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
1 2
Data
Structures

Software
engineering
Discrete
mathemati
cal
structures

BMSIT&M
DEPARTMENT OF CS&E
2020-2021
 KNIGHT’S TOUR PAGE NO - 4 OF 7

Program outcomes (POs):

PO1 Engineering knowledge: Apply the knowledge of Mathematics, Science, Engineering

fundamentals and an engineering specialization to the solution of complex engineering
problems

PO2 Problem analysis: Identify, formulate, review research literature, and analyse complex
Engineering problems reaching substantiated conclusions using first principles of
mathematics, Natural sciences and engineering sciences

PO3 Design/development of solutions: Design solutions for complex engineering problems and
design system components or processes that meet the specified needs with appropriate
consideration for the public health and safety, and the cultural, societal, and environmental
considerations.

PO4 Conduct investigations of complex problems: Use research-based knowledge and

research methods including design of experiments, analysis and interpretation of data,
and synthesis of the Information to provide valid conclusions

PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern Engineering and IT tools including prediction and modelling to complex
engineering activities with an understanding of the limitations.

PO6 The engineer and society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.

PO7 Environment and sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of,
and need for Sustainable development

PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.

PO9 Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings

BMSIT&M
DEPARTMENT OF CS&E
2020-2021
KNIGHT’S TOUR PAGE NO - 5 OF 7

PO10 Communication: Communicate effectively on complex engineering activities with the

engineering Community and with society at large, such as, being able to comprehend
and write effective reports And design documentation, make effective presentations,
and give and receive clear instructions.

PO11 Project management and finance: Demonstrate knowledge and understanding of the
Engineering and management principles and apply these to one’s own work, as a member
and Leader in a team, to manage projects and in multidisciplinary environments.

PO12 Life-long learning: Recognize the need for, and have the preparation and ability to engage
in independent and life-long learning in the broadest context of technological change.

Project to Program Specific Outcomes (PSO) Mapping

Project Name: Knight's tour

COURSE PSO1 PSO2

Data
Structures

Software
engineering

Discrete
mathematical
structures

Program Specific Outcomes (PSOs):

PSO1 Analyze the problem and identify computing requirements appropriate to its solution.

PSO2 Apply design and development principles in the construction of software systems of
varying complexity.

BMSIT&M
DEPARTMENT OF CS&E
2020-2021
KNIGHT’S TOUR PAGE NO - 6 OF 7

Abstract:
1. A Knight Tour problem is an ancient puzzle which remains as a focus of current
researcher, whose goal is to find out how to construct a series of legal moves made by a
knight so that it visits every square of a chessboard exactly once.
2. If the knight ends on a square that is one knight's move from the beginning square (so that
it could tour the board again immediately, following the same path), the tour is closed;
otherwise, it is open.
3. The knight's tour problem is the mathematical problem of finding a knight's tour. The
objective of a Knight Tour algorithm is to find out a solution with construct a closed
moving path by a knight for visiting each square of a chessboard by only once.
4. This new proposed method fulfills any board size of 4n+2 where n>1 with lower
execution time and without the needs of any brute force method and backtracking method.

Introduction:-
1. A Knight Tour problem is an old but interesting issue that still arouse the attention of
researcher nowadays. The criteria of a legal Knight Tour move require each of the square
checker only allow visited by Knight by only once.
2. Knight Tour, in another word, is sharing common situation with Travelling Salesman
problem, where Knight Tour is an un-weighted for each square. Knight Tour problem on a
chessboard of size 8×8 first studied by Euler in year of 1759. Right after, it become a
famous topic in mathematic field with many different solutions.
3. Initially, research has been conducted on a small chessboard, as a result, many skills has
been proposed such as brute force algorithm, divide-and-conquer algorithm and neural
network solution.
4. The advantages of these methods are quick and the easy to implement. Over the decade,
Knight Tour getting its own place and involved in many other research fields such as
watermarking and steganography.
5. As a result, Knight Tour problem become crucial when it come across a bigger chessboard
as previous solution was not able to cater the latter.

Motivation:-
1. We all know what the Knight's Tour is: move the knight so it visits every square of the
chessboard just once.
2. There are around 30 trillion ways to do this, but it is certainly not easy for humans to
execute a single one correctly — least of all blindfolded and starting from a random
square.
3. So we thought, how about we make the computer involve and help in solving this
problem.

Existing System:-
1. The common method of constructing the closed Knight Tour move is moving the Knight from a
single starting point to the ending point on a sequential way. Ball and Coxeter proposed a bisected
Knight Tour solution by dividing the chessboard into two rectangular regions and limit the Knight
to finish the visit of first region before proceeding to second region.
2. This method revised by Dudeney in his book , where the idea of former is extended into four
equal parts with each the same size and shape and trespass twice on the other parts. Domoryad
use the idea of quadrisect Knight Tour as but without visit the center square checker.
BMSIT&M
DEPARTMENT OF CS&E
2020-2021
KNIGHT’S TOUR PAGE NO – 7 OF 7

3. Hurd and Trautman on the other hand, proposed a opened Knight Tour move which produces
the almost same result as with different algorithm and the unvisited square shifted to one of the
corner of the chessboard.
4. Parberry invented a divide-and-conquer algorithm and introduced a concept of “structured”
Knight Tour which able to construct a closed Knight Tour moves of various types. By mean of
dividing the chessboard, a closed legal move also able to calculate when encounter larger
chessboard.
Limitations of Existing System:
1.As we all know that Knight’s tour is one of the problem statement that makes every programmer
eager to learn about the process of programming a code.
2.Similarly we were also enthusiastic and were eager to learn about the problem statement.
3. But unfortunately there were some limitation that were faced by us during the process of
knowing about the “Knight’s Tour”.
4. So the limitation was that we were not able to show the pictorial representation about, how a
knight would travel alongside the chessboard so that it would cover all the squares.
5. So we went on to use the #include <graphics.h> as one of the header file, which would help us
show how actually a knight move and covers all the squares present in an 8X8 chessboard.

Proposed system
➔ To practice on tree traversals, graph traversal dealing with real word problems.
➔ To implement possible heuristics to reduce the complexity while traversing.

System Requirement Specifications (Functional and Non-Functional)

➔ The software should try all the possibilities to the given situation and give the exact results
for the knight problem.
➔ The knight should not traverse the already traversed cell again.
➔ The knight should not move outside the board.

Proposed Methodology
This software uses the backtracking algorithm in which the knight is allowed to move as
far as possible until it comes to a blind alley, and at this point it backs up some number of steps
and then tries a different path. It uses the basic data structures like 2d arrays which represents
the chess board and each cell represented by index numbers.
References
➔ Websites for the concept of knight’s tour.
➔ Videos for the backtracking algorithm and code for the knight’s tour.
o https://youtu.be/07yVVGltD7w
o https://youtu.be/1YspHboTIWg

ABSTRACT
CONCEPTS USED IN:
DSA-
BACKTRACKING ALGORITHM-
Backtracking is a general algorithm for finding all solutions to some computational problems,
notably constraint satisfaction problems, that incrementally builds candidates to the solutions,
and abandons a candidate as soon as it determines that the candidate cannot possibly be
completed to a valid solution.
BMSIT&M
DEPARTMENT OF CS&E 2020-2021