code resolving magic

flat assembler
Message board for the users of flat assembler.

Index > Main > code resolving magic

Goto page Previous 1, 2

Author

Thread

baldr

Joined: 19 Mar 2008
Posts: 1651

baldr 13 Jul 2010, 14:12

vid,

Then join in and let's form a society of sorts!

13 Jul 2010, 14:12

revolution
When all else fails, read the source

Joined: 24 Aug 2004
Posts: 20298
Location: In your JS exploiting you and your system

revolution 13 Jul 2010, 14:20

I wonder if the fasm preprocessor can be programmed to play Go? Razz

Simple rules to follow. But making it a strong player would be tough to do in any reasonable allowed decision time.

13 Jul 2010, 14:20

vid
Verbosity in development

Joined: 05 Sep 2003
Posts: 7105
Location: Slovakia

vid 13 Jul 2010, 14:27

Since the number of states is finite in Go, I'd say in theory it can, as long as we disregard implementation limits. Smile

13 Jul 2010, 14:27

revolution
When all else fails, read the source

Joined: 24 Aug 2004
Posts: 20298
Location: In your JS exploiting you and your system

revolution 13 Jul 2010, 14:46

Hence my stipulation "reasonable allowed decision time". Where clearly "reasonable" does not mean unlimited time till the end of the universe.

13 Jul 2010, 14:46

baldr

Joined: 19 Mar 2008
Posts: 1651

baldr 13 Jul 2010, 15:03

You never know how far that will drive you... Wink

13 Jul 2010, 15:03

Goto page Previous 1, 2

< Last Thread | Next Thread >

Forum Rules:

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum