heuristics
Here are 641 public repositories matching this topic...
An implementation of the SAS+ planning language in Java, as described in Malte Helmert's paper "A Planning Heuristic Based on Causal Graph Analysis", and the latter "Unifying the Causal Graph and Additive Heuristics" with Hector Geffner.
-
Updated
Oct 16, 2018 - Java
Game Agent implementation and Heuristic Analysis
-
Updated
Feb 26, 2017 - Python
Some assignments done during my undergraduate course.
-
Updated
Feb 1, 2019 - C
Heuristics for creating casts with the minimum amount of actors.
-
Updated
Nov 12, 2021 - Java
Linear Programming and Heuristics examples applied to Transportation problems
-
Updated
Jul 26, 2021
travel salesman problem
-
Updated
Jan 6, 2022 - Jupyter Notebook
Travelling Salesman Problem solved using Backtracking, and approximation algorithms such as: Triangular Approximation Heuristic, Closest Neighbour Heuristic and our own heuristic! Developed in C++ for the subject: "Design of Algorithms"
-
Updated
Jun 4, 2023 - C++
Simple Python project that uses standard libraries in conjunction with PyGame for the GUI. Allows the user to create a maze using their mouse, define starting position [S_i,S_j], goal position [G_i,G_j], and run different pathfinding algorithm visualizations from informed (Greedy, A*) to uninformed (DFS,BFS) and choose between L1 and L2 heuristics
-
Updated
Apr 27, 2023 - Python
-
Updated
Jul 7, 2024 - Jupyter Notebook
Repository for our Optimization Methods and Algorithm project.
-
Updated
Jan 8, 2019 - C++
This repository applies various optimization techniques to solve the Flow Shop Scheduling Problem (FSSP), from brute force solutions to advanced metaheuristics and our own solution named FSSP-DQN.
-
Updated
Jul 16, 2024 - Jupyter Notebook
Data and Code for Article
-
Updated
Sep 21, 2023 - Java
Pathfinding Algorithm for Obstacle-Rich Boards
-
Updated
Mar 17, 2024 - Python
This is a Java implementation of the game Omega with Human versus AI players and different maps
-
Updated
Jan 24, 2023 - Java
This program will approximate the Traveling salesman problem using 3 three different algorithms (Nearest Neighbot, 2Opt, and 3Opt). There are 6 different combinations and each can be run individually or in suite as part of a benchmark test.
-
Updated
Jul 31, 2024 - Java
A bot for Ultimate Tic-Tac-Toe game on http://theaigames.com/ and http://pub.theaigames.com/competitions/ultimate-tic-tac-toe
-
Updated
Jun 6, 2016 - Java
-
Updated
Feb 5, 2017 - Python
Improve this page
Add a description, image, and links to the heuristics topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the heuristics topic, visit your repo's landing page and select "manage topics."