Closed

Java Chess: Find the Checkmate in one

This project was awarded to oanagoge for $200 USD.

Get free quotes for a project like this
Employer working
Awarded to:
Skills Required
Project Budget
$30 - $250 USD
Total Bids
11
Project Description

The project is to create 'states' in the chessboard where checkmate is possible in only one move (the next move).
Take a look at [url removed, login to view] for such examples.

The aim is to find an algorithm that produces such states in reasonable time, maybe through a genetic algorithm or pattern matching or efficient trial&error approach.

What I expect is a software that creates various cases that will be used in a multiple choice game of the type: Which of the following moves leads to a checkmate in one? for teaching purposes. To succeed this I need a software where:

The input of the program is an integer 'n' that indicates "how many different states" to produce.

The implemented algorithm is supposed to create 'n'-sized "one-move checkmate states". I expect that the output will NOT only create simple variations of a specific case of checkmate. I need variety in results (and not the same pattern again and again), so chessboard initialization state should be random enough to create various checkmate in one cases (eg by moving the queen or the bishop or the pawn etc). Thus, I need a reasonable number of different patterns (for this project at least 20 different patterns) that lead to checkmate. I highlight that the algorithm should be scalable to support other patterns in the future, so I need a short tutorial how to attach a new pattern in the future.

The output of the program will be a ('n'-sized) set/list of objects, where each object will have the following attributes:
a) a data structure (eg an array [8][8]) that represents the current chessboard state (GUI is not required),
b) a variable that indicates who's turn is it (eg Black Plays)
c) a list of possibles moves that lead to a checkmate (in one move)
d) a list of possible moves that lead to a stalemate (in one move)
e) a list of possible moves that place the king in check, but it is not a checkmate (in one move)

Just to know, this is only a part of the real project, thus a number of similar freelancer job posts will follow in the next weeks.
*Also, I would be happy to hear any new ideas for other possible multiple-choice chess-related games (or other popular (strategy/mind) board games) that can be answered in less than 30 seconds. In case some of your ideas are really interesting, I will post a new project ASAP.

Looking to make some money?

  • Set your budget and the timeframe
  • Outline your proposal
  • Get paid for your work

Hire Freelancers who also bid on this project

    • Forbes
    • The New York Times
    • Time
    • Wall Street Journal
    • Times Online