Placing N chess queens on an NxN chessboard so that no two queens threaten each other.
-
Updated
Feb 14, 2017 - Java
Placing N chess queens on an NxN chessboard so that no two queens threaten each other.
SQL blind data extraction POC
Implementation of Depth First Search, Breadth First Search, Iterative Deepening and A* for solving a puzzle game. This is part of a coursework assignment for Intelligent Systems module (COMP2208 - @ University of Southampton)
8 Puzzle Game
Practical implementations of Fundamental AI concepts
Water Sort & Bloxorz Solver
Solving Towers of Hanoi game using uninformed search algorithms. (B.Sc. course work)
Introductive Course to Artificial Intelligence
Solving missionary cannibal problem using different search strategies in C
Search Strategies
Solve the 8 puzzle with my algorithm.
A research and implementation project about the N-Puzzle game
Introduction to Artificial Intelligence-BKU-CS
A java program that solves the Eight Puzzle problem using five different search algorithms.
Tasks for a college course titled Biologically Inspired Algorithms
Implementation of Blind Searches and Heuristics at Knapsack problem
Solving the N-Queens problem using a blind and informed (heuristic) search. (School Project - 2017)
Add a description, image, and links to the blind-search topic page so that developers can more easily learn about it.
To associate your repository with the blind-search topic, visit your repo's landing page and select "manage topics."