Skip to content

Calculates the shortest path for a knight to get from one position to another on a chessboard, using a queue and BFS. Made for Data Structures 1 course.

Notifications You must be signed in to change notification settings

annaravazzi/chess-knight-problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Trabalho Prático Estrutura de Dados 1

Por: Anna Carolina Ravazzi Martins (RA: 2235250)

Professor: Rodrigo Minetto

Curso de engenharia da computação UTFPR

Descrição do projeto: Menor distância para um cavalo chegar de um ponto a outro no tabuleiro de xadrez, fazendo uso do Tipo Abstrato de Dados "fila" e do algoritmo de busca "Breadth-First Search"

Relatório em vídeo: https://youtu.be/m6a22FMUa6I

About

Calculates the shortest path for a knight to get from one position to another on a chessboard, using a queue and BFS. Made for Data Structures 1 course.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published