Search Results for "b-tree"
Sort By:
Showing 18 open source projects for "b-tree"
View related business solutions-
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
Scid vs. PC
Chess Database and Toolkit program
...It has many interface fixes and improvements, and is fully compatible with Scid's .si4 databases. New features include a rewritten Gamelist, Computer Tournament, and FICS, Tree, Book and Graph improvements. -
2
<b>The project is continued at https://github.com/Scrabble3D. Find the latest program version under Binaries.</b> Scrabble3D is a highly customizable Scrabble game that not only supports Classic Scrabble and Superscrabble but also 3D games and own boards. You can play local against the computer or connect to a game server to find other players.
-
3
ChessX
Chess Database and PGN viewer
A free and open source chess database application for Linux, Mac OS X and Windows. -
4
chessPDFBrowser
Chess application whichs allows working with chess PDF books and PGNs.
Chess application which allows working with PDFs and PGNs. You can work with the chess games of the PDF and edit their tree of variants. Graphical environment. Standard PGN TAGs. PGN comments. Ocr like (Fen string detection from chess board position images). Connection to Uci chess engines (like stockfish). Position analysis, full game analysis. You can now play games against uci engines. pdf2pgn command line command included. Detailed documentation. -
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
5
Basic Blind Chess
Blind Chess using Taiwan rules
Blind Chess also known as "Dark Chess" (暗棋) or "Banqi" or Half Chess , is a two-player Chinese board game played on a 4x8 grid, or half of the xiangqi (Chinese Chess) board. This application is using Taiwan rule. AI is using basic minimax tree structure and some rules. Advanced algorithm such as Upper Confidence bounds applied to Trees and Monte Carlo Tree Search are NOT used. This app is single player vs computer only. For English user, Christakis Giorgios made Software Requirements Specification(pdf file), it will help anyone that downloads this application to understand basic blind chess and use it. ... -
6
VR Ax Java Sources & Build Projects
VR Adrix Java Works - Paged Lists - Action-Entity Model ...
Adrix.NT Java Works :: Sources & Build Projects includes - Paged Lists of Object & Iterators Library for Java - Action / Entity Model for Java - VR Ax AWT Clock Java Component - VR Multi Dimensions Array Library - VR MDArray List Manager Library - VR Adjacency (List | Matrix) Direct Graph Lib - VRJMosaic cells sliding game with automatic resolver - VR RectsWorld Sample Applic - VR Free Chess 2D Applic also contains - Other Utils Libraries - Demo and Test Applications -... -
7
Fuego is a collection of C++ libraries for developing software for the game of Go. It includes a Go player using Monte-Carlo tree search.
-
8
PyBreak360
breakout/arkanoid clone multiplayers network game at 360°!
...So, i made it: an arkanoid / breakout clone which have the particularity to play at 360°. pybreak360.cfg to fine configure outside game. pybreak360_kbd.py for special international keymap. on game, use mouse or arrow keys. press B to start/stop ComputerBootPlayer. press H to see HiScores. press D for LevelDesigner (see in levels/*.level to edit/create fine configured levels as BrickArray, Background, Music, ...) press PAGE_UP, PAGE_DOWN to change level in actual level pack. press SPACE or ENTER for menu. select level pack using menu/F9. play alone or connect up to 4 players via TCP network. ... -
9
RuzzleSolver
Takes in a ruzzle input and solves it
...Runs a DFS on the Ruzzle grid and at each instance checks if the word formed is a valid one. 2. Since the size of a grid is just 4 x 4, optimizations (such as using a suffix tree) aren't that important. 3. The total list of possible words is obtained fairly quickly. Less than 10 seconds on an i7 machine (without using any form of parallelization or multithreading). 4. The TWL06 wordlist, same as the one used by Ruzzle, is used as the dictionary. 5. The automated swiping is done by controlling the mouse pointer and getting it to move around automatically. ... -
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
10
-
11
Panzercheckers
checkers game with official brazilian rules
Checkers board game with official brazilian rules. The game engine uses an endgame database with up to 4 pieces. Many optimization techniques were used to generate and process the game tree tree and minimax algorithm. Bitboards and zobrist keys are also used. -
12
BB Arena is a Java Open Source version of a fantasy football game, that allow roster creation, network play, match report generation and easy rules customization. Project migrated to https://github.com/Teg79/BBArena/tree/develop
-
13
-
14
Chess Training Tools including tools for chess visualization training, analysis tree training, and opening training.
-
15
Classic game solved with MinMax algorithm (full solution tree) and simple Heuristics. Specially for learning and teaching computer AI
-
16
C2hess stands for Chinese chess, a well-known board game. C2Chess provides both chess engine and GUI but the focus is on chess tree search algorithms.
-
17
Play Gomoku against computer player. The computer player is implemented using a min/max tree with alpha-beta pruning.
-
18
This is a program able to play the connect-four game, using a minimax tree search. The interesting part is that the search tree is independent of the heuristic and can be reused. Is written in compiled java.
- Previous
- You're on page 1
- Next
