OlegDudnyk/RobotCNXTCurriculum
Exercises solutions from robotC curriculum (http://www.robotc.net/education/curriculum/nxt/)
SortAlgoBot performs a classic Quicksort sorting algorithm on an array of twelve colored Lego balls. It detects all colors in the first round. Then the sorting starts and all 'swaps' the algorithm makes are executed. Programmed in C# with VisualStudio 2010 and the excellent Mindsqualls Lego Mindstroms Nxt library. It fires of commands to Motorcontrol, a great third party application for better controlling motor movements on the Nxt brick.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
Exercises solutions from robotC curriculum (http://www.robotc.net/education/curriculum/nxt/)
This is a simple graph library written on C#.
Public repository.
The 8-Puzzle Problem is a thing they throw at you when you study Artificial Intelligence. It’s a great little problem for learning to understand search trees and shortest path algorithms with heuristics. Traveling via Breadth-First Search, via Depth First Search we mostly end up with the A* Algorithm using a Manhattan Distance Heuristic for effectively solving this problem. This article shows a way how to do this in C#.