Search Results for "graph"

Looking for mines on triangular or rectangular fields. The computer moves mines in the background, so that you must not guess. If you set hard level, you will die every time you make a mistake. You can change the board size and mines density.

...Our autonom entity enters into the matrix from the pre-determined starting point which is (9,4). autonom is expected to find its way until it reaches the (0,x) point. In version 1.0.0, we have limitations; - We're in 2 dimensional world, meaning we have only x and y axis. - We have a one-way graph. There's only one solution to find the way from the starting point to the (0,x) point. Future versions will include 3 dimensional space and will include more complex mazes with many solutions. Arda Ulas UNLU ardaulas@hotmail.com

This is a C++ implementation of Puyo Puyo, a Japanese computer puzzle game of 1991. It uses Qt and Boost Graph Libraries and some design patterns and works with any platform on which Qt is available. It can be used as a tutorial for learning game design.

ksudoku is a fully-featured Sudoku puzzle generator and solver for KDE. With it you can generate and play 3D and 2D puzzles of different sizes and levels. The main algorithm is fast and extendable to any general graph coloring problem.