How to find a solution for my Gin problem?

Recently I w开发者_StackOverflowas playing a game of Gin with my grandmother. We played a whole afternoon and as far as I can remember, I didn't won a single game.

So I told here that it with the help of computers it could become a much better player. She couldn't believe how computers could be useful there and that's why I want to demonstrate it.

I already implemented part of the logic, but now I have the problem that my solver is really not so sexy because he mainly is based on a brute force method. That is I calculated all the possibilities, score them according to the chances for a win and choose the best one. Is there any more sophisticated approach?

I'm talking about standard Gin. The implementation is done in C#.

---

I'm not 100% familiar with gin, but one thing to keep in mind is each strategy can be broken.

When you play, you have to play multiple players. Do they both have the same strategy? Do they have different strategy? If we played you might beat me in gin, but I might beat your grandma. How does your grandma know how to play? If you were given the same hand she does, how would she play it differently than yours? Yes you can take a look at the statistics, but your grandma doesn't play by statistics - she plays by experience. If you want to make it more sophisticated ask yourself "How can I factor experience into the hand?"