Algorithm to solve a variation of Tic-Tac-Toe game
$30-250 USD
Ολοκληρώθηκε
Αναρτήθηκε περίπου 9 χρόνια πριν
$30-250 USD
Πληρωμή κατά την παράδοση
Write an program which is smart enough to score 4 in the Tic-Tac-Toe variant game listed here:
[login to view URL]
Or have your program prove it is not possible.
Details on the origin of this puzzle can be read here:
[login to view URL]
But note that I want specifically to score 4 against the "Version 3 cpu player", and dont care about the more difficult general problem asked there.
**NOTE**: If you are smart enough to score 4 without a computer program, just give me the move sequence and that will be acceptable as well.
Connect4 is solvable in a couple of seconds using minimax on a modern computer. This will take longer because a) the board size is bigger b) there are more than one moves allowed per column c) The opponent gets two moves. But I still believe it's feasible in a reasonable computational-time frame. I can write you a minimax algorithm with alpha-beta pruning in a few hours.
I am a beginner but passionate about solving the puzzle.
I will take this as a challenge to myself and try with all i have got.
I think i can solve it.
I have good knowledge of
-> Artificial Intelligence techniques
-> Puzzles and their complexities (complexity theory)
P.S : I am willing to try to solve this problem even if it is assigned to some one more experienced or capable.
$55 USD σε 3 ημέρες
0,0 (0 αξιολογήσεις)
0,0
0,0
7 freelancers δίνουν μια μέση προσφορά $129 USD για αυτή τη δουλειά
I'll update this bid once I get a score of 4 . Please do message me so that it would be easy for me to contact you . I think its impossible to attain a score of 4 . I'll give a proof if its impossible
I'm an Electrical Engineer in Communications and Electronics. I have a lot of experience working with C/C++ (more than 5 years) and I have designed and developed several projects like yours. Is impossible to score more than 3 on the game, if you want I can build a code to prove it so please contact me.