Thread View: comp.ai.genetic
1 messages
1 total messages
Started by rodney james freier
Mon, 11 Jan 1993 16:20
Re: Simple problems to solve genetically
Author: rodney james freier
Date: Mon, 11 Jan 1993 16:20
Date: Mon, 11 Jan 1993 16:20
28 lines
1729 bytes
1729 bytes
Hello.
As some of you have pointed out, my lengthy analysis of the blackjack
problem overlooked some obvious optimizations. For example, blackjack does
not care one whit about the suit of the cards, only their value. So, instead
of needing to keep track of the 52 cards, it only has to keep track of 10
different values. Then we have:
Hand's value 9
dealer's upcard 10
my first card 10
my second card 10
for a total of 9000 bits for the strings. This is actually workable. For
five cards, the total approaches 10k. This is pushing it.
(My insistence on 52 cards is what is technically known as a Brainfart(tm).)
Some of you have mentioned much simpler counting methods... both simpler
to code and simpler for a human to use in play.
I agree that all this work seems to have taken some of the fun out of
making a computer learn. But I don't believe I have done the significant
learning. Actually, what I'm doing requires and results in
NO knowledge of when to hit and when to stay. All I am doing is trying to
make sure that my string pattern can represent ANY conceivable strategy, and
the mechanics of selection then search this space to find effective strategies.
Rod
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads