8000 GitHub - yianan261/AI_Algorithms: Game applications using AI algorithms such as minimax search with alpha-beta pruning game-tree search for dominoes game, iterative deepening depth first search (IDDFS) and A* search for Tile Puzzle game, and breadth-first uninformed graph search for Lights Out Puzzle game
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

Game applications using AI algorithms such as minimax search with alpha-beta pruning game-tree search for dominoes game, iterative deepening depth first search (IDDFS) and A* search for Tile Puzzle game, and breadth-first uninformed graph search for Lights Out Puzzle game

Notifications You must be signed in to change notification settings

yianan261/AI_Algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

AI_Algorithms

AI Algorithms

This repository contains implementations of AI algorithms in game applications.

Uninformed search

Examples include breadth first graph search on Lights out puzzle game and linear disk game, and exhaustive search in the N-queens game.

Informed search

Examples include iterative deepening depth first search (IDDFS) and A* search using the Manhattan distance heuristic in the tile puzzle game.

Game-Tree search

The folder "adversarial_games" include the dominoes game example that uses Minimax search with alpha-beta pruning where an AI player simulates game with human player.

About

Game applications using AI algorithms such as minimax search with alpha-beta pruning game-tree search for dominoes game, iterative deepening depth first search (IDDFS) and A* search for Tile Puzzle game, and breadth-first uninformed graph search for Lights Out Puzzle game

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

0