![]() You’re game has a nice graphic and speed but I think the dice can be improved by using methods like: Genetics algorithm or specially PC LEARNING. In backgammon, the next move can not be guessed completely beacause it depends on the dice and the players decision too. ![]() You may want to say that if you record the dices that I get in long term I’ll see that they’re random but I have to say that they only look random while they’re not. I know that greedy algorithm is not a perfect one and it mostly fails but by manipulating the dice when needed, you have made it perfect. The answer is: You have had considered a percentage for the upcomming dice in the your algorithm which makes it greedy in real world too □. This means the computer or better to say the algorithm does not play perfectly but how can it win several games while playing like this? What I mean is I may have 3 stones left and only one of them open in front of the computer’s single stone at my side, but the computer decides to make its stones safe by putting them on each other or by taking open spots at its own side rather than taking my open stone which may be its last chance to win. I THINK (Or better to say I personally believe) that your game uses an algorithm similar to the greedy algorithm wich mostly relies on the apponents dice and moves.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |