Skip to content
#

path-finding

Here are 87 public repositories matching this topic...

#include-only, single header, custom written ai that can play ANY turn based game, including Boardgames, Card-games, hidden-info games, multiplayer games, and games with randomness.

  • Updated Apr 8, 2024
  • C++

🚀Welcome to the H.A.R.E. Mars Rover project, where we've unleashed the power of Haskell monads to chart precise paths across the Martian landscape 🗺️, while our disk rotation wizardry ensures data integrity even in the harshest conditions. From chunking files for floppy disk storage to dynamic track allocation, we're redefining space exploration.

  • Updated Sep 1, 2023
  • Haskell

A decision-making algorithm used for game playing and decision-making problems. This algorithm combines the power of Monte Carlo simulation with the depth of tree search to find the best move or action. This GitHub project implements MCTS in Kotlin to solve decision-making problems efficiently.

  • Updated Feb 8, 2023
  • Kotlin

Improve this page

Add a description, image, and links to the path-finding topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the path-finding topic, visit your repo's landing page and select "manage topics."

Learn more