Search the web
Sign In
New User? Sign Up
staticrecompilers · Static Binary Translation
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Hear how Yahoo! Groups has changed the lives of others. Take me there.

Best of Y! Groups

   Check them out and nominate your group.
Having problems with message search? Fill out this form to ensure your group is one of the first to be migrated to the new message search system.

Messages

  Messages Help
Advanced
AI-style lookahead..?   Message List  
Reply | Forward Message #307 of 326 |
Re: AI-style lookahead..?

On Tue, Mar 25, 2008 at 6:24 AM, jankaspermartinsen
<jankaspermartinsen@...> wrote:
>
> --- In staticrecompilers@yahoogroups.com, "Graham Toal" <gtoal@...> wrote:
> >
> > I had a thought today (while watching "The King of Kong" as it
> > happens) which is this...
> >
> > we can emulate classic video games at what - 1000 times faster than
> > real time? 10,000 times?
> >
> > So wouldn't it be possible to set up a real-time emulation that worked
> > out the best play
> > for any game by forking at each decision point and playing ahead -
> > either a fixed window like
> > 10 seconds, or maybe to the end of the screen - so that it could work
> > out a perfect game
> > in real time... much the same as classic AI techniques are used to
> > lookahead in other
> > games like checkers, backgammon, scrabble, whatever...
> >
> > I'm wondering just how much speed is needed to pull this off, and what
> > pruning algorithms.
> >
> > Can you for example play a perfect game just by knowing that you can't
> > die in the next
> > 10 seconds, for example, or do some games require more long-term
> > strategy & planning?
> >
> > I'm thinking of the classic games like mspac, donkey kong, qbert etc?
> >
> > I know that various people have worked on AI players for games like
> > pacman, but I believe
> > they're just heuristics, I don't think anyone has thrown power &
> > classic AI techniques
> > at it yet?
> >
> > Would be a truly cool student project by the way, if we have any
> > students reading...
> >
> > G
> >
>
> Hi,
>
> I've been thinking about that too, maybe making some sort of game
> tree. But if I remeber correctly, I feared that the game tree would
> easily be very large (but please prove me wrong)
>
> jkm

well, think about a game like pacman - there are a very few *right*
choices to make and a lot of *wrong* choices. So although the
branching ratio is indeed large, I have a strong suspicion that
fruitless paths (no pun intended) will die off early. It may be
sufficient to only ever guarantee that you can live for the next 10
seconds for example, to be able to always win, rather than look ahead
to the end of the screen.

G
PS Your yahoo email address is bouncing (acct disabled) so I posted my
reply to the group instead.



Tue Mar 25, 2008 9:44 pm

graham_toal
Offline Offline
Send Email Send Email

Forward
Message #307 of 326 |
Expand Messages Author Sort by Date

I had a thought today (while watching "The King of Kong" as it happens) which is this... we can emulate classic video games at what - 1000 times faster than ...
Graham Toal
graham_toal
Offline Send Email
Feb 24, 2008
12:15 am

... I had a vague idea of the same kind of thing, used to find the end sequence of a game, but I had the problem of doing it statically - it would not be able...
Jeremy Smith
jeremyalansmith
Offline Send Email
Feb 24, 2008
10:44 pm

On Tue, Mar 25, 2008 at 6:24 AM, jankaspermartinsen ... well, think about a game like pacman - there are a very few *right* choices to make and a lot of...
Graham Toal
graham_toal
Offline Send Email
Mar 25, 2008
9:45 pm
Advanced

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help