C# RushHour Puzzle

  •        92

RushHour Project uses the A* algorithm to solve instances of the Rush Hour puzzle. This involved implementing a graph-search version of A*, along with three heuristics, and testing the implementation on several Rush Hour puzzles

http://rushhour.codeplex.com/

Tags
Implementation
License
Platform

   




Related Projects

RushHour - How to solve RushHour!


How to solve RushHour!

foorushhour - RushHour game written in C# with solver using DFS and BFS algorithm


RushHour game written in C# with solver using DFS and BFS algorithm

3lectrologos-RushHour


A RushHour solver using A* implemented in Java.

foorushhour


Simple desktop application games like RushHour written in C#, with feature automatic solve..



RushHour - Foursquare venue crowd data visualization.


Foursquare venue crowd data visualization.

olbat-rushhour


Java Rush Hour game solver (AI-A*)

research - CP vs IP runtimes when using Google-CP Solver on a time scheduling problem


CP vs IP runtimes when using Google-CP Solver on a time scheduling problem

clar - What tests are made of.


Clar is a minimal C unit testing framework. It's been written to replace theold framework in [libgit2][libgit2], but it's both very versatile andstraightforward to use.Can you count to funk?- **Zero: Initialize test directory** ~~~~ sh $ mkdir tests $ cp -r $CLAR_ROOT/clar* tests $ cp $CLAR_ROOT/test/clar_test.h tests $ cp $CLAR_ROOT/test/main.c.sample tests/main.c ~~~~- **One: Write some tests** File: tests/adding.c: ~~~~ c /* adding.c for the "Adding" suite */

cp - ca for cp site


ca for cp site

cp - cp


cp

CP-M-for-OS-X


A z80 emulator + CP/M-80 reimplementation that intends to allow original CP/M software to be used under OS X.