Kurs języka Java, semestr zimowy 2016/2017 II UWr
-
Updated
Feb 25, 2017 - Java
A maze is a type of puzzle involving a collection of paths, usually where a player has to find a route from start to finish.
A huge variety of algorithms exist for generating and solving mazes. These are not only fun to implement, but also are a good way to familiarise yourself with programming techniques, algorithms, and languages.
Kurs języka Java, semestr zimowy 2016/2017 II UWr
Algorithms - Java Implementation 🤘
Tarea 2 de Estructuras de Datos (2020-2)
Generate and test mazes in Java
Maze Runner, which consists of multiple levels of increasing difficulty levels for the users to play and compete against the computers and themselves. Features: random maze generation on run-time, visualization of the shortest path using BFS, and is made user-friendly by the inclusion and application of UI.
This contains the code for my Computer Science Extended Essay regarding Maze-Solving Pathfinding algorithms.
Find probability of solution in the Maze , Using MonteCarlo simulation
Procedurally generated dungeon crawling experiment
Simple Java application to generate and solve mazes using graph theory.
An approach to Entombed game for Atari 2600
A program that generates and solves random mazes
A group project of testing different algorithms of maze solving
A maze generation and solving game written in Java.
The Application uses Tree traversal Algorithms to generate a random maze and to find the shortest path through it. used DFS to generate a random maze, and BFS to find the Shortest path.
Finds the fastes way out of a maze
Maze project part C in JavaFX