Python Client library for Qaekwy Operational Research Solver
-
Updated
Apr 28, 2024 - Python
Python Client library for Qaekwy Operational Research Solver
🕹 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.
C++ 课程设计项目,基于 Qt 制作的一个简单的走迷宫小游戏
Repositório da disciplina de Inteligência Artificial pela Universidade Federal do Ceará, campus Quixadá
A mini Google. Custom web crawler & indexer written in Golang.
Задачи по курсу "Комбинаторные алгоритмы"
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).
Решения практических заданий по курсу "Комбинаторные алгоритмы".
In Order Traversal , Pre Order Traversal , Post Order Traversal,Breadth First Traversal,Deep First Traversal
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.
FileExplorer VSCode sidebar clone was made using the depth-first search algorithm, which creates a tree of files and folders, and also performs deletions.
BFS, DFS algorithm: visiting
An N-puzzle solver written for a class project.
Implementing searching algorithms
Add a description, image, and links to the deep-first-search topic page so that developers can more easily learn about it.
To associate your repository with the deep-first-search topic, visit your repo's landing page and select "manage topics."