This project requires a knowledge of cryptography. We will need a candidate who has written a solution for an open knight's tour in the past.
Our scope here is of GF 2^infinity. Which allows us the ability to program an open knight's tour solution involving 16 by 16 squares of elements.
We need an algorithm in either straight forward approach or divide and conquer method or neural network. We need a method that will generate
solutions in decimal numbers lined up according to the knight's move. This will follow a standard state as specified.
Before you are awarded this bid :All contestant will need to write a simple program what will solve an 8 by 8 square OPEN knight's tour solution. When the scope increase things get a little complicated. To keep is simple follow the steps.
1. You will write program that will solve open knight's tour-solution must be visualized as the knight moves.
2. You will ID the moves on every element or squares with numbers which you will then spit in a .txt file (all paths is a part of sets solutions) found outside your program.
Please read this carefully before asking any question. This is not as simple as it seems.
Hi Sir, I have experience of PHP,AJAX,JAVA SCRIPT,XML,MYSAL, HTML,WEB DESIGNING, DATA ENTRY SOFTWARE ENGINEER,ASP NET,C#,SQL,GIS,MLM,ECOMMERCE ,APPLICATION DEVELOP, SERVER, SCRIPTING,HOSTING,MAIL SET UP. , let me do it ,
I have solved the open knight tour problem for programming contest like ICPC, Facebook Hacker Cup and Google Code Jam. I have 4+ years of experience with algorithms in C++ and Java.