search-algorithm

A Search engine Based of Simularity, Utlizing a Hierarchy Genre Umbrella system with vector simularity

Private, on-device semantic search for your own documents.

Search policies for LLM AutoTune: the policy SDK, a reference random search, and a chaos policy

An open-source, local-first Model Context Protocol (MCP) server for **AI Search Crawler Governance, Brand Safety Guardrails, Canonical Integrity, and IndexNow Notifications

A search engine that goes through a vast library of Edexcel IAL Past Papers (January 2010 to January 2025). A sleek way to find any question from a vast library of past papers, to perhaps make topicals or just find an answer to.

Snake AI project for the NLPF 2026 course, in two parts (1h30 each): a PyTorch Deep Q-Learning agent (Linear_QNet, 14-value state, epsilon-greedy, experience replay, Bellman equation), and pathfinding algorithms (Dijkstra, GBFS, plus a custom Hamiltonian-cycle hybrid that always wins). Base game left unmodified.

低コスト、長い待ち時間、高品質

Senet game with an Expectiminimax AI, custom evaluation function, caching, and search-tree analysis.

JAxtar is a project with a JAX-native implementation of parallelizeable A* & Q* solver for neural heuristic search research.

https://pypi.org/project/aigyminsper/

Deep file search utility for Windows

Retrieves viral TikTok content for you automatically

Pokémon TCG AI agent for the PTCG AI Battle Challenge, built on the real cg battle engine: v1 frozen baseline through v7 — real A/B-tested expectimax search, learned leaf-value model, belief-state opponent modeling, and an engine-cross-validated card dataset. Every result real, self-play tested, reported honestly.

Solving the Eight Queens problem using a Genetic Algorithm in Python.

The official source repository for AXIOM. Read the technical white paper at doi.org/10.6084/m9.figshare.33514507.

Academic benchmark of search algorithms on 2D grids. Compares A*, BFS, DFS, Dijkstra and Bidirectional Search with Manhattan, Euclidean, Chebyshev and Octile heuristics using search-library.

Academic demonstration of search algorithms on weighted city road networks. Compares A*, BFS, DFS, Dijkstra and Bidirectional Search for optimal pathfinding using search-library.

A professional, extensible search algorithm framework for discrete spaces. Implements A* with pluggable heuristics for graphs and 2D grids.

A classical AI forward-planning algorithm (STRIPS-style) implemented from scratch in Python, built on a hand-written first-order unification algorithm. Created for a graduate Artificial Intelligence course.

基于洛谷的个人算法与数据结构学习记录，以 Python 为主、C++ 为辅，按专题整理题目代码与学习笔记。