Bejeweled Algorithm

All I need is simply a program which has an algorithm for finding the best Bejeweled move, pointswise,? from a grid.

The program needs to be able to handle a varying grid size? any number of different coloured gems.

It can be structed however you wish, using arrays or classes for grids etc. Entirely up to you, but it must be quick, and easy to input new grids.

The program doesn't need to scrape any grids from anything, there just needs to be a solve function which is called and has an argument containing the grid, and it returns a move.

Upon acceptance of the bid, I will supply you with the scoring rules (ie the points for amount of gems etc.)

## Deliverables

In VB.net 2008 preferably, 2005 or VB6 is acceptable also however. Please let me know which language you are choosing to work with in your bid.

This project really shouldn't take long for someone who can handle creating algothirms.

.NET Техніка Microsoft MySQL PHP Архітектура ПЗ Тестування ПЗ Visual Basic Робочій стіл Windows

ID Проекту: #3868123

Про проект