Timeline for Become the Champion
Current License: CC BY-SA 3.0
23 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Oct 10, 2016 at 12:55 | comment | added | Ton Hospel |
The number of X 's and O 's is never used to determine who must move in my program. You always must give the position with X to move. So if it is really O to move you must swap X and O . So for your example the input to my program is -O-X -O-- O-O- X--X . The result 1X3O 3X33 X3X3 O33O , which agrees with yours (1 is win, 3 is loss)
|
|
Oct 10, 2016 at 12:39 | comment | added | user58988 | If number of X is the same numbers of O: than move X; for me begin always X; for you begin O? it is for this one would not swap X and O | |
Oct 10, 2016 at 11:14 | comment | added | user58988 | It would result The only win for O, it would be the start one, the 0 coordinate all the other ones are all lost moves for O... | |
Oct 10, 2016 at 9:46 | comment | added | Ton Hospel | @RosLuP Yes, that agrees with what my program gives. | |
Oct 10, 2016 at 9:25 | comment | added | user58988 | I would implemented the evaluation function for for tic tac Latin...for the position pl -X-O -X-- X-X- O--O ^D analysis for the O in response result to me the table -1 3 1 3 1 3 11 3 1 3 1 3 1 1 3 were -1 means win O, 3 means occupied, 1 means win X, 0 mean no win | |
Oct 6, 2016 at 10:00 | comment | added | user58988 | Yes I make one error in encode when it win, I thought it was "xxxo" or "ooox" (3 contiguos symbols the same line and one different; instead it was 3 symbols of one type and one of the other type... Excuse I don't know how cancel above comments from my cellphone... Good morning... | |
Oct 6, 2016 at 8:37 | comment | added | user58988 | In linear coordinate 0..15 O in 0, X in 6 (column 3 row 2 beginning to count from 1) than O has to lost for what I see it not win... | |
Oct 5, 2016 at 22:11 | comment | added | Ton Hospel |
@RosLuP O to move means you should reverse the colors, so give as input -O-X -O-- O-O- X--X . This returns that O wins by playing in the top left. This is correct since it defends the diagonal and is a double threat along the top and along the left.
|
|
Oct 5, 2016 at 20:18 | comment | added | user58988 | tictaclatin.pl -X-O -X-- X-X- O--O ^D The next to move is O... It seems that x win in every place one put O... | |
Sep 25, 2016 at 15:45 | history | edited | Ton Hospel | CC BY-SA 3.0 |
added 5 characters in body
|
Sep 25, 2016 at 15:44 | comment | added | Rohan Jhunjhunwala | Huh, ideOne seems borked | |
Sep 25, 2016 at 15:35 | history | edited | Ton Hospel | CC BY-SA 3.0 |
deleted 16 characters in body
|
Sep 25, 2016 at 15:33 | comment | added | Ton Hospel |
@RohanJhunjhunwala Just rechecked the driver program. Runs fine, $move is declared on line 11. I have no idea if there is a human heuristic. This program just does minimax on the game tree, it doesn't have any strategic knowledge.
|
|
Sep 25, 2016 at 15:25 | comment | added | Rohan Jhunjhunwala | Is there a heuristic solution a human can implement? | |
Sep 25, 2016 at 15:25 | comment | added | Rohan Jhunjhunwala | Variable '$move' is not declared at prog.pl:2 | |
Sep 25, 2016 at 15:23 | comment | added | Ton Hospel | @RohanJhunjhunwala Ok, added a simple interactive driver | |
Sep 25, 2016 at 15:19 | history | edited | Ton Hospel | CC BY-SA 3.0 |
added 2522 characters in body
|
Sep 25, 2016 at 13:06 | history | edited | Ton Hospel | CC BY-SA 3.0 |
added 355 characters in body
|
Sep 25, 2016 at 11:42 | comment | added | Rohan Jhunjhunwala | NIce answer. Could you provide some easy way for me to test this? Ideally it would love to see an interactive version... (this is jut for my own curiosity). | |
Sep 25, 2016 at 3:31 | history | edited | Ton Hospel | CC BY-SA 3.0 |
added 53 characters in body
|
Sep 25, 2016 at 3:22 | history | edited | Ton Hospel | CC BY-SA 3.0 |
edited body
|
Sep 25, 2016 at 3:12 | history | edited | Ton Hospel | CC BY-SA 3.0 |
added 185 characters in body
|
Sep 25, 2016 at 2:53 | history | answered | Ton Hospel | CC BY-SA 3.0 |