Display website menu using DFS algorithm

Implementation of Depth First Search, Breadth First Search, Iterative Deepening and A* for solving a puzzle game. This is part of a coursework assignment for Intelligent Systems module (COMP2208 - @ University of Southampton)

Maze Game using stack and queues in java

8 puzzle solver using BFS, DFS and A* , It has simulation that shows the path from start till reaching the goal.

🧐 알고리즘 문제 풀이 Chapter 1 (Java)

2021 - Ejercicios de Arboles y grafos en donde se aplican las tecnicas BFS (Breadth-first search) y DFS (Depht-first search)

A simple but funny maze generator and automatic path finder.

This is a puzzle solver created from scratch by myself, with the purpose of practice and fun. If you are looking for a solver for the puzzle below or interested in how the solver was formulated, this page is for you! Disclaimer: I did not create the puzzle.

It contains all efficient logics/algo to famous problems asked in top companies

VT Programming team lecture 2016.02.04

알고리즘과 자료구조를 정리해두었습니다.

Maze Game in java using Depth First Search

DFS, BFS, IDS, UCS, Bi-directional, A*, IDA*, SMA*...

Accepted Solutions of Leetcode problems

An assignment done as part of my 'Introduction to A.I' module. This implements just the first project of the Berkeley Pacman projects.

This study plan is for those who want to prepare for technical interviews. The problems have been carefully curated so that levels 1 and 2 will guide beginner and intermediate users through problems that cover the data structures and algorithms necessary to succeed in interviews with most mid-tier companies.

data structures

This project converts a maze into a graph representation and performs various graph-related operations on it.The maze is represented as a 2D array of characters where: "S" indicates the start point, "F" indicates the final (end) point,"E" indicates an empty point, and "-" indicates a wall.