🕹 Algoritmo que resolve o jogo dos oito por busca em profundidade(sem estados visitados), busca em largura(com estados visitados), busca gulosa(com estados visitados) e busca a*(com estados visitados). Podendo mostrar passo a passo das escolhas dos nós e mostrando a árvore resultante(até um certo limite ou completa) do método de busca selecionado.

Repositório da disciplina de Inteligência Artificial pela Universidade Federal do Ceará, campus Quixadá

Python Client library for Qaekwy Operational Research Solver

In Order Traversal , Pre Order Traversal , Post Order Traversal,Breadth First Traversal,Deep First Traversal

Решения практических заданий по курсу "Комбинаторные алгоритмы".

A mini Google. Custom web crawler & indexer written in Golang.

Maze generator using depth-first search algorithm

Solutions to the homework problems presented in Artificial intelligence and Machine learning courses.

A JavaScript solution for Hanoi tower puzzle.

A maze can be generated by starting with a predetermined arrangement of cells with wall sites between them.

Задачи по курсу "Комбинаторные алгоритмы"

Assignments given during the course Informed Search Methods in AI in Reykjavik University, during the Double Degree study period.

N皇后问题/Android

Algoritmo para encontra la salida de un laberinto, dado un punto de inicio y algunos obstáculos, usando un algoritmo de búsqueda no informada de tipo "Búsqueda en profundidad" (DFS).

FileExplorer VSCode sidebar clone was made using the depth-first search algorithm, which creates a tree of files and folders, and also performs deletions.

An N-puzzle solver written for a class project.

Implementing searching algorithms

BFS, DFS algorithm: visiting

randomized maze generator using the Depth-First Search algorithm in javascript