Las Vegas Algorithms: The Eight

Queen problem
Gajera Niraj Borsaniya Parth
MCA Department MCA Department
Nirma University Nirma University
Ahmedabad, India Ahmedabad, India
23MCA016@nirmauni.ac.in 23MCA004@nirmauni.ac.in

Abstract—This paper presents a novel application of the Las

Vegas approach to solve the classical 8-queens problem. The 8-
queens problem involves placing eight queens on an 8x8
chessboard in such a way that no two queens threaten each
other. The Las Vegas algorithm, known for its randomized
nature with a guaranteed correctness of solutions, is applied to
tackle this combinatorial optimization problem. This paper
explores the implementation, performance analysis, and
comparison with deterministic methods.

I. INTRODUCTION
The 8-queens problem is a well-known problem in
computer science and combinatorial optimization. The
objective is to find all possible arrangements of eight
queens on an 8x8 chessboard where no two queens can
attack each other. Traditional deterministic algorithms
such as backtracking are commonly used for solving this
problem. However, this paper explores the application
of the Las Vegas approach, which introduces
randomness into the solution process. IV. USING THE LAST VEGAS ALGORITHM
Las Vegas algorithm is a randomized algorithm that
II. EASE OF USE always gives correct results; that is, . However, the
runtime of a Las Vegas algorithm differs depending on
The Las Vegas algorithm for the 8-queens problem the input. The usual definition of a Las Vegas algorithm
involves randomly placing queens on the chessboard includes the restriction that the expected runtime be
and checking whether each placement satisfies the finite, where the expectation is carried out over the
constraint of no two queens attacking each other. If a space of random information, or entropy, used in the
valid solution is found, it is returned; otherwise, the algorithm. An alternative definition requires that a Las
process is repeated with a different random placement. Vegas algorithm always terminates (is effective), but
The algorithm continues until a valid solution is found. may output a symbol not part of the solution space to
indicate failure in finding a solution. The nature of Las
Vegas algorithms makes them suitable in situations
III. PROBLEM STATEMENT
where the number of possible solutions is limited, and
The eight queens’ problem is a classical combinatorial where verifying the correctness of a candidate solution
problem. To access to right solution of this problem, we is relatively easy while finding a solution is complex.
must put all the queens on the 8x8 board so that no
queen is attacked with the other queens (No Queen
conflicting with other queens).
So, the solution must be nonattack (the queen is attacked
if it shares the same row, column, or diagonal with
another queen) as shown in "Figure 1" [1,2,3]. In the
other words, a solution of the eight queens’ problem
must be ensured that each queen can move to the eight
neighboring directions (two vertical, two horizontal and
four diagonal directions) without attacking with other
queens as shown in figure.

XXX-X-XXXX-XXXX-X/XX/$XX.00 ©20XX IEEE

 VI. USE CASES
V. CODE OF 8 QUEEN A. Machine Learning and Optimization: Randomized
algorithms are utilized in various machine learning
import random
tasks such as optimization, clustering, and
dimensionality reduction. They are often employed to
def printBoard(board, n):
handle large datasets efficiently and to explore diverse
for i in range(n):
for j in range(n): solutions.
print(board[i][j], end=" ")
print("\n")
print("\n")
B. Network Routing and Optimization: In network routing
def QueensLasVegas(n):
board = [[0 for j in range(n)] for i in range(n)]
problems, randomized algorithms can be used to find
availColumns = [] efficient routes through a network, minimizing latency
for a in range(n): and congestion. They are applied in dynamic routing
availColumns.append(a)
R = 0
scenarios where network conditions change over time.
while len(availColumns) != 0 and R < n:
temp = []
for i in availColumns:
if isSafe(board, R, i): C. Cryptography and Security: Randomized algorithms
temp.append(i) play a crucial role in cryptography for generating
if len(temp) == 0:
return False secure cryptographic keys, performing encryption and
rand = random.choice(temp) decryption operations, and ensuring randomness in
board[R][rand] = 1
R += 1
cryptographic protocols. They are also employed in
availColumns.remove(rand) security protocols for authentication and access control.
printBoard(board, n)
return 1

def isSafe(board, row, col): D. Bioinformatics: Randomized algorithms are used in

for i in range(col):
if board[row][i]:
bioinformatics for analyzing biological data, such as
return False DNA sequencing and protein structure prediction. They
i = row
help in solving complex computational problems in
j = col
while i >= 0 and j >= 0: genomics, proteomics, and evolutionary biology.
if board[i][j]:
return False
i -= 1
j -= 1 E. Quantum Computing: Randomized algorithms have
i = row
applications in quantum computing for tasks such as
j = col
while i >= 0 and j < 8: quantum state preparation, quantum sampling, and
if board[i][j]: quantum optimization. They are utilized to exploit the
return False
i = i - 1
unique properties of quantum systems to solve
j = j + 1 computational problems more efficiently.
return True

i = 0
for a in range(1000): F. Game Theory and Economics: Randomized algorithms
if QueensLasVegas(8) == 1:
i += 1
are applied in game theory and economics for modeling
print(i) strategic interactions, equilibrium analysis, and
print("Success rate is: ", i/1000)
mechanism design. They are used to study the behavior
of agents in complex systems and to design incentive
mechanisms for achieving desirable outcomes.

G. Distributed Systems: Randomized algorithms are

employed in distributed systems for achieving consensus,
leader election, and load balancing. They help in
designing fault-tolerant and scalable distributed
protocols that can operate efficiently in dynamic
environments

Quantum Computing
This use case highlights how quantum computing, combined
with the Las Vegas algorithm approach, can tackle the N-
Queens problem efficiently, offering benefits in terms of
speed, scalability, and solution quality.
Quantum Computing Approach:
Quantum computing harnesses the principles of quantum
mechanics to perform computations. Unlike classical
computers that use bits to represent information as either 0
or 1, quantum computers use quantum bits or qubits, which
can exist in superpositions of states, enabling them to
process vast amounts of data simultaneously.
Problem Representation:
Quantum computing represents the N-Queens problem using
qubits, the fundamental units of quantum information. Each
qubit encodes a potential position for a queen on the
chessboard.
Quantum Gates and Operations:
Quantum gates manipulate qubits to explore possible
solutions. These gates perform operations such as
superposition, entanglement, and interference, allowing for
the simultaneous evaluation of multiple board
configurations.
Superposition and Parallelism:
Quantum superposition enables qubits to exist in multiple
states simultaneously. This property allows the quantum
algorithm to explore many potential solutions in parallel,
significantly speeding up the search process compared to
classical methods.
Measurement and Verification:
After exploration, the quantum algorithm measures the
qubits to obtain a solution. Due to the probabilistic nature of
quantum computation, multiple measurements may be
necessary to ensure the correctness of the solution.
Las Vegas Algorithm Approach:
The Las Vegas algorithm approach is utilized within the
quantum framework to iteratively refine solutions. Random
placements of queens are made on the chessboard, and
validity checks are performed. If an invalid solution is
found, the process repeats until a valid solution is obtained.
Performance Evaluation:
The performance of the quantum N-Queens algorithm is
evaluated based on solution quality, computational resources
utilized, and runtime. Quantum algorithms may offer
significant speedups and scalability advantages over
classical approaches, especially for large problem sizes.
Graph Coloring Problems:
Quantum computing can be employed to solve graph
coloring problems, where the goal is to assign colors to
vertices of a graph such that no adjacent vertices share the
same color. The N-Queens algorithm can be adapted to find
solutions to graph coloring by mapping vertices to
Image Recognition and Pattern Matching:
rows/columns of a chessboard and colors to the
presence/absence of queens.
Scheduling and Timetabling:
Quantum computing can optimize scheduling and
timetabling problems by efficiently assigning tasks or events
to time slots or resources. The N-Queens algorithm can be
used to find conflict-free schedules by mapping tasks to
queens and time slots/resources to positions on a
chessboard.
DNA Sequence Analysis:
Quantum computing can aid in DNA sequence analysis,
particularly in solving alignment and matching problems.
The N-Queens algorithm can be adapted to find optimal
alignments between DNA sequences by representing
nucleotides as chessboard positions and exploring possible
matches using quantum parallelism.
Telecommunications Network Optimization:
Quantum computing can optimize telecommunications
network layouts and routing configurations to minimize
interference and maximize efficiency. The N-Queens
algorithm can be utilized to find optimal network
configurations by representing network nodes and
connections as queens and exploring interference-free
placements using quantum principles.
Resource Allocation in Logistics:
Quantum computing can optimize resource allocation
problems in logistics and supply chain management, such as
warehouse layout design and vehicle routing. The N-Queens
algorithm can assist in finding optimal resource allocations
by representing resources and constraints as queens and
exploring feasible configurations using quantum parallelism.
Cryptographic Key Generation:
Quantum computing can enhance cryptographic key
generation by efficiently generating secure key pairs. The N-
Queens algorithm can be applied to generate prime numbers
or unique sequences by representing potential key values as
queens and exploring valid combinations using quantum
superposition and measurement techniques.
Robot Path Planning:
Quantum computing can optimize robot path planning in
complex environments by finding collision-free paths for
robots to navigate. The N-Queens algorithm can be adapted
to represent robot positions and obstacles as queens on a
virtual chessboard, enabling the exploration of safe paths
using quantum parallelism.
Financial Portfolio Optimization:
Quantum computing can optimize financial portfolio
management by efficiently selecting investment strategies
that maximize returns while minimizing risks. The N-
Queens algorithm can assist in portfolio optimization by
representing investment options and constraints as queens
and exploring optimal combinations using quantum
principles.
Drug Discovery and Molecular Simulation:
Quantum computing can accelerate drug discovery and
molecular simulation by efficiently exploring chemical
compound configurations and interactions. The N-Queens
algorithm can be utilized to find optimal molecular
structures by representing atoms and bonds as queens on a
lattice and exploring possible configurations using quantum
parallelism.
Quantum computing can enhance image recognition and
pattern matching tasks by efficiently analyzing large
datasets and identifying complex patterns. The N-Queens
algorithm can aid in image recognition by representing pixel
arrangements and features as queens on a chessboard and
exploring potential matches using quantum parallelism.
Benefits:
Speedup:
Quantum computing offers the potential for significant
speedup over classical algorithms, allowing for faster
solution discovery and optimization in various domains.
Scalability:
Quantum algorithms, including the N-Queens algorithm, can
efficiently scale with problem size, enabling the exploration
of larger solution spaces and complex problem instances.
Parallelism:
Quantum parallelism allows for the simultaneous
exploration of multiple solution candidates, enhancing the
efficiency of search and optimization algorithms.
Solution Quality:
Quantum algorithms can yield high-quality solutions to
optimization and combinatorial problems, providing
accurate and reliable outcomes for real-world applications.
Resource Efficiency:
Quantum computing can optimize resource allocation and
utilization, leading to more efficient and cost-effective
solutions in various domains, such as logistics,
telecommunications, and finance.
Innovation and Discovery:
Quantum computing opens up new possibilities for
innovation and discovery across scientific, technological,
and
commercial domains, driving advancements in areas such as
healthcare, materials science, and artificial intelligence.
Enhanced Accuracy:
Quantum computing offers the potential for enhanced
accuracy in solving optimization problems by leveraging
quantum coherence and interference effects. This can lead to
more precise solutions compared to classical approaches,
especially for problems with complex constraints and
interactions.
Reduced Energy Consumption:
Quantum algorithms, including the N-Queens algorithm,
have the potential to reduce energy consumption in
computational tasks due to their inherent parallelism and
optimization capabilities. This can result in lower
operational costs and environmental impact, particularly in
large-scale computing environments.
Novel Solution Discoveries:
Quantum computing enables the exploration of novel
solution spaces and unconventional problem-solving
approaches that may not be feasible with classical
algorithms. The N-Queens algorithm, when executed on a
quantum computer, can unveil unexpected solutions and
insights that lead to breakthroughs in various domains.
Real-Time Decision Making:
Quantum computing facilitates real-time decision making by
rapidly evaluating and updating solutions to dynamic and
time-sensitive problems. The N-Queens algorithm, coupled
with quantum parallelism, allows for quick adaptation to
changing conditions and requirements, enabling responsive
decision-making processes.
Improved Resource Utilization:
Quantum algorithms, such as the N-Queens algorithm, can
optimize resource allocation and utilization in diverse
applications, leading to more efficient use of computational
resources, storage, and bandwidth. This optimization can
result in cost savings and improved performance across
various industries.
Robustness to Noise and Errors:
Quantum error correction techniques can enhance the
robustness of quantum algorithms, including the N-Queens
algorithm, against noise and errors inherent in quantum
hardware. This improves the reliability and stability of
quantum computations, ensuring consistent and accurate
results even in noisy environments.
Cross-Domain Applications:
The N-Queens algorithm, implemented on a quantum
computer, can find applications across multiple domains,
including finance, logistics, healthcare, cybersecurity, and
more. Its versatility and scalability make it adaptable to
diverse problem sets, driving innovation and advancements
across various sectors.
Data Privacy and Security:
Quantum computing offers advancements in cryptography,
enabling the development of secure encryption and
decryption protocols. The N-Queens algorithm can
contribute to cryptographic applications by generating and
optimizing cryptographic keys, enhancing data privacy and
security in communication systems and digital transactions.
Cross-Platform Compatibility:
Quantum algorithms, including the N-Queens algorithm, can
be implemented on various quantum computing platforms
and architectures, fostering interoperability and accessibility
across different hardware and software ecosystems. This
ensures that quantum solutions are adaptable and scalable
across diverse computational environments.
Sustainable Computing Practices:
Quantum computing has the potential to promote
sustainability in computing by reducing energy consumption
and environmental impact. The N-Queens algorithm, when
executed on quantum hardware, contributes to sustainable
computing practices by optimizing resource usage and
minimizing carbon footprints associated with traditional
computing methods.
In conclusion, the utilization of the N-Queens algorithm in
quantum computing offers a multitude of benefits across
diverse domains and applications. By leveraging quantum
principles such as superposition, parallelism, and
interference, the N-Queens algorithm enables efficient
optimization and solution discovery for complex
combinatorial problems. From enhancing accuracy and
reducing energy consumption to promoting sustainability
and data privacy, quantum-enabled N-Queens algorithm
provides transformative capabilities that drive innovation
and address real-world challenges.
Bioinformatics
In bioinformatics, the N-Queens problem serves as a
metaphorical model for solving various computational
challenges related to the arrangement and interaction of
biological entities such as DNA sequences, proteins, or
molecular structures. Here's how the N-Queens algorithm
can be applied in bioinformatics:
Genomic Sequence Analysis:
The N-Queens problem can be used to represent the
arrangement of nucleotides within a DNA sequence. Just as
queens must be placed on a chessboard such that they do not
threaten each other, certain patterns of nucleotides may be
constrained due to genetic interactions or functional
requirements. By adapting N-Queens algorithms,
bioinformaticians can explore possible configurations and
analyze the implications for gene expression, protein
synthesis, or evolutionary relationships.
Protein Structure Prediction:
In protein structure prediction, the N-Queens problem can
analogously represent the spatial arrangement of amino
acids within a protein molecule. Certain amino acid residues
may need to be positioned in specific orientations to form
functional protein structures or to avoid steric clashes. By
employing N-Queens algorithms, researchers can explore
the conformational space of proteins, predicting their three-
dimensional structures and understanding their functional
properties.
Drug Design and Molecular Docking:
N-Queens algorithms can be utilized to model the spatial
interactions between small molecule ligands and protein
binding sites during drug design and molecular docking
studies. Just as queens on a chessboard must avoid
threatening each other, small molecules must bind to protein
targets in energetically favorable conformations. By
applying N-Queens approaches, researchers can explore the
binding geometries of ligands within protein active sites,
facilitating the design of novel therapeutic agents with
improved potency and selectivity.
Metabolic Pathway Analysis:
The N-Queens problem can represent the spatial
arrangement of metabolites within biochemical pathways.
Similar to arranging queens on a chessboard, the positioning
of metabolites within pathways may be subject to spatial
constraints or regulatory interactions. By adapting N-Queens
algorithms, bioinformaticians can analyze metabolic
networks, identifying optimal configurations that maximize
pathway efficiency or minimize metabolic flux imbalance.
Evolutionary Biology and Phylogenetics:
In evolutionary biology and phylogenetics, the N-Queens
problem can be employed to model the evolutionary
relationships between species or genetic sequences. Just as
queens on a chessboard must be positioned to avoid threats,
genetic sequences may exhibit structural constraints or
conservation patterns due to evolutionary pressures. By
applying N-Queens algorithms, researchers can reconstruct
phylogenetic trees and infer ancestral relationships,
elucidating the evolutionary dynamics of biological systems.
RNA Secondary Structure Prediction:
RNA molecules fold into complex secondary structures
crucial for their function. Similar to the N-Queens problem,
where queens should not threaten each other, RNA
secondary structures have base pairing rules where certain
nucleotides form base pairs while others avoid pairing to
maintain stability. By adapting N-Queens algorithms,
researchers can explore possible RNA secondary structure
configurations, aiding in predicting functional RNA motifs,
such as riboswitches or microRNA binding sites.
Comparative Genomics and Genome
Rearrangement:
Comparative genomics involves comparing genetic
sequences across different species to understand
evolutionary relationships and identify conserved regions.
Genome rearrangement events, such as inversions,
translocations, and duplications, can be represented using
combinatorial optimization problems like the N-Queens
problem. By applying N-Queens algorithms, researchers can
model genome rearrangement scenarios, infer evolutionary
histories, and elucidate genomic rearrangement mechanisms
driving species divergence and adaptation.
Protein-Protein Interaction Networks:
Proteins interact with each other forming intricate networks
crucial for cellular functions. Analogous to the N-Queens
problem, where queens represent interacting entities, such as
proteins, protein-protein interaction networks can be
modeled using combinatorial optimization approaches. By
adapting N-Queens algorithms, researchers can explore
possible configurations of protein interactions within
networks, identifying key protein hubs, functional modules,
and disease-associated protein complexes.
Epigenetic Regulation and Chromatin Structure:
Epigenetic modifications, such as DNA methylation and
histone modifications, play vital roles in regulating gene
expression and chromatin structure. The N-Queens problem
can be used to model chromatin configurations where
nucleosomes are positioned along DNA strands without
interfering with each other. By applying N-Queens
algorithms, researchers can investigate chromatin folding
patterns, epigenetic marks distribution, and their impact on
gene regulation and cellular differentiation.
Population Genetics and Genetic Diversity:
Population genetics studies genetic variation within and
between populations. The N-Queens algorithm can be
adapted to model genetic diversity scenarios, where alleles
are distributed across populations without violating genetic
constraints. By employing N-Queens algorithms, researchers
can simulate population genetic processes, such as gene
flow, genetic drift, and natural selection, shedding light on
population history, demographic changes, and disease
susceptibility patterns.
Overall, the N-Queens algorithm serves as a versatile tool in
bioinformatics, offering insights into the spatial
arrangement, interaction, and optimization of biological
entities across various scales, from nucleotide sequences to
molecular structures to ecological systems. Its application
highlights the interdisciplinary nature of computational
biology, bridging concepts from mathematics and computer
science to address complex biological questions.
Benefits:
Computational Efficiency:
The N-Queens algorithm, with its combinatorial
optimization approach, offers computational efficiency in
solving complex biological problems. By leveraging
efficient algorithms and data structures inspired by the N-
Queens problem, bioinformaticians can analyze large-scale
biological datasets with reduced computational resources
and runtime, enabling faster discovery and hypothesis
testing.
Scalability:
Bioinformatics often deals with datasets of varying sizes,
from individual genetic sequences to entire genomic
databases. The scalability of the N-Queens algorithm allows
it to handle increasing dataset sizes efficiently. Whether
predicting protein structures, analyzing genomic sequences,
or simulating population genetics, the N-Queens algorithm
can adapt to the computational demands of diverse
bioinformatics applications, accommodating larger datasets
without sacrificing performance.
Problem Modeling and Abstraction:
The N-Queens algorithm provides a versatile framework for
modeling and abstracting diverse biological problems. By
mapping biological entities and interactions onto the N-
Queens problem, researchers can formulate complex
biological questions as combinatorial optimization
problems, facilitating algorithm design and implementation.
This abstraction allows for a unified approach to tackling
various bioinformatics challenges, from sequence analysis to
systems biology.
Interdisciplinary Insights:
The application of the N-Queens algorithm in bioinformatics
fosters interdisciplinary collaboration between mathematics,
computer science, and biology. By bridging concepts from
combinatorial optimization, algorithm design, and biological
modeling, the N-Queens algorithm enables researchers to
integrate diverse methodologies and perspectives, driving
innovation and cross-disciplinary advancements in
understanding biological systems.
Algorithmic Innovation:
The adaptation of the N-Queens algorithm to bioinformatics
problems stimulates algorithmic innovation and algorithmic
diversity. Bioinformaticians can explore novel algorithmic
techniques inspired by the N-Queens problem, such as
heuristic search strategies, metaheuristic algorithms, and
parallel computing approaches, to address specific
challenges in biological data analysis, optimization, and
simulation.
Insights into Biological Systems:
The application of the N-Queens algorithm in bioinformatics
yields insights into the organization, dynamics, and
evolution of biological systems. By solving combinatorial
optimization problems analogous to biological phenomena,
researchers can uncover underlying principles governing
gene regulation, protein-protein interactions, evolutionary
dynamics, and ecosystem structure, enhancing our
understanding of complex biological processes and
phenomena.
Translational Impact:
The insights gained from applying the N-Queens algorithm
in bioinformatics have translational implications for
biomedical research and healthcare. By elucidating
molecular mechanisms underlying diseases, identifying
potential drug targets, and predicting therapeutic outcomes,
bioinformatics approaches informed by the N-Queens
algorithm contribute to precision medicine, drug discovery,
and personalized healthcare, ultimately improving patient
outcomes and public health.
Education and Training:
The use of the N-Queens algorithm in bioinformatics
provides educational and training opportunities for students
and researchers. By implementing and analyzing N-Queens-
based algorithms in bioinformatics courses, workshops, and
research projects, individuals gain valuable experience in
algorithm development, computational biology, and
problem-solving skills, preparing them for careers in
academia, industry, and healthcare.
Overall, the benefits of using the N-Queens algorithm in
bioinformatics extend beyond computational efficiency to
encompass scalability, problem modeling, interdisciplinary
insights, algorithmic innovation, biological understanding,
translational impact, and educational value, positioning it as
a valuable tool for advancing biological research and
applications.
ACKNOWLEDGMENT
WE WOULD LIKE TO EXPRESS OUR SINCERE GRATITUDE TO
ALL THOSE WHO CONTRIBUTED TO THE COMPLETION OF THIS
RESEARCH PAPER.
FIRST AND FOREMOST, WE EXTEND OUR DEEPEST
APPRECIATION TO OUR FACULTY MEMBER PROF. SONIA
MITTAL WHOSE GUIDANCE, EXPERTISE, AND UNWAVERING
SUPPORT WERE INVALUABLE THROUGHOUT THIS RESEARCH
ENDEAVOR. THEIR INSIGHTFUL FEEDBACK AND
CONSTRUCTIVE CRITICISM GREATLY ENRICHED THE QUALITY
OF THIS WORK.
REFERENCES
[1] https://citeseerx.ist.psu.edu/document?
repid=rep1&type=pdf&doi=e63a015940646fd9bf428be61a2534b305
5d1766
[2] Wikipedia:- https://en.wikipedia.org/wiki/Las_Vegas_algorithm
[3] https://slideplayer.com/slide/4965867/