Chess
Name:
Anonymous
2008-12-18 16:45
It's a science.
Name:
Anonymous
2008-12-18 18:09
O RLY?
Name:
4tran
2008-12-20 21:09
It is if you brute force the game tree.
Name:
Anonymous
2008-12-20 21:11
that would take about a million years with todays technology
Name:
Anonymous
2008-12-21 0:37
the question is, whenever tomorrows technology can do it in 10 minutes, what will you have to say.
its kind of like the they can't put a man on the moon saying, but then after they put a man on the moon, what do people say?
Name:
Anonymous
2008-12-21 11:36
O SHI-. How much power in actual Flops, to brute force the game tree?
Name:
Anonymous
2008-12-21 12:23
>>3
Pretty certain brute forcing the game tree takes more bits of data than there are atoms in the universe.
Or some silly thing like that.
Name:
Anonymous
2008-12-21 13:21
It's an obsolete AI benchmark.
Name:
Anonymous
2008-12-21 17:08
Name:
Anonymous
2008-12-23 13:16
>>9
Wow. Anyone know how close we are to doing this?
Name:
Anonymous
2008-12-23 14:10
2~ 300 years.
Name:
Anonymous
2008-12-23 16:07
>>10
to doing what? Having more memory in a computer than there are atoms in the universe?
Try never, what the fuck would we store the memory as.
Name:
Anonymous
2008-12-23 16:42
It would be impossible, we would have to fit at least 1 tb in like a .1 Picometer area
Name:
Anonymous
2008-12-23 21:33
>>12
We'd store the memory in other dimensions, obviously.
Name:
Anonymous
2008-12-23 23:57
>>14
Can't something like that be done with holograms or some shit?
Name:
Anonymous
2008-12-24 2:59
Storing memory in a hologram? wat/
Name:
Anonymous
2008-12-24 9:23
>>14
Obviously you're a retard
Name:
Anonymous
2008-12-24 14:32
Name:
Anonymous
2008-12-27 1:49
>>17
>>18
No! I'm a retard!
Name:
Anonymous
2008-12-27 3:01
Better to try with backgammon, niggers.
Name:
Anonymous
2008-12-27 5:02
>>17
You're not familiar with the fourth?
Name:
FrozenVoid
!FrOzEn2BUo
2009-01-06 9:39
Chess can be reduced to graph optimizations.
Its not hard with current computing power.