I sent a message to the OP about you.
We will see what he decides to do, if he wants to he will just block you.
The last 3 or more pages of this topic is mainly your spam, always in bursts of 3 or more posts.
Will computers ever solve chess?
Sort:
[COMMENT DELETED]
I think once we have quantum computers chess will be solved.
Jun 21, 2017
0
#1085
s23bog wrote:
As for the task of solving chess, there is the subtask of processing positions, and there is the subtask of recording the action. For simplicity's sake, let's say that just the display of the position serves both purposes. The record of the event could just be a short film taken by a phone cam.
So .... how would you actually display every possible position in the matter of a few minutes, or hours?
Infinitesimally short bursts of light is how I might attempt it. That got me thinking about display technology and how a LEM (light emitting marble) might work. One of them projects different colored light beams in a variety of different directions. One or more together communicating by touch.
If you want pulses at 10^38 per second or so, this involves at least 10 kJ per pulse (due to the laws of quantum mechanics). So total energy involved is around 10^42 J, which is about as much as 10,000,000,000,000,000,000,000 years of current human consumption!
Jun 21, 2017
0
#1086
s23bog wrote:
I think you are too caught up in spamming (advertising) your own game to realize some people just don't think like you, mr game "designer".
As one guy on this topic said: "Pot Calling Kettle Black"
You forgot to mention that you have "invented" a game called 777.
Well actually what you are doing is learning C++ by making a "game".
It is very clear to me that you have no idea how programming in chess works.
Yet you continue to spam silly ideas on this topic, ideas that you have not even considered properly or even thought through.
I do not even bother reading your spam.
Chess is a game created by the gods/goddesses; it will never be solved. It's as complex as the entire universe...
Computers may solve chess someday, but it will never change the way that OTB games are played. The fifty-move rule is waived in the attempt to achieve perfect chess. Also, according to Wikipedia, when both players play "perfect chess", with the fifty-move rule waived, the game must end in a draw, or else, chess is not truly solved.
Sorry, just realized that this post is (originally) 3 years old. I'm not trying to keep it open.
ChopinCJ wrote:
Sorry, just realized that this post is (originally) 3 years old. I'm not trying to keep it open.
Looking at how many people don't understand basic mathematics my prediction it'll only close after chess is solved 
(or chess.com ceases to exist)
Jun 22, 2017
0
#1091
s23bog wrote:
Could you please explain why it takes at least 10kJ per pulse?
The general answer is that it's Heisenburg's uncertainty principle. The specific version for light notes that for a quantum of light there is the relationship:
E = h f, where E is the energy and f is the frequency and h is Planck's constant
Putting f = 10^42 / 10000 and h = 6.63 × 10^-34 Js gives you the absolute minimum energy per cycle, if you are working through 10^42 of them in 10000 seconds (you can't work with less than 1 photon!). This needs multiplying by 10^42 to get the total energy cost. This is of course an over-optimistically low estimate.
[I didn't bother about great precision].
Jun 22, 2017
0
#1092
s23bog wrote:
As for burst of light, and power requirements ... last night, my thoughts went to a site I worked at while in PA. It was located very near to a rail road. Since the fiber optic trunks were buried along railroad tracks it had a very fast connection. I think I recall the manager saying that it had an OC192 connection (or perhaps two).
Bursts of light. Whole lot of them every millisecond.
Of course, normal light has a frequency of up to 750 THz, so it oscillates up to 750 trillion times a second. This gives a single mode blue light fiber optic cable a maximum theoretical bandwidth of definitely less than 750 Terabits per second. In practice less is achieved, even though dense wavelength multiplexing is used, but it's still enough for millions of people to stream Netflix.
This is TINY compared with 10^38 Hz.
Jun 22, 2017
0
#1093
"Scientists in China have taken the next step in creating an internet that can’t be hacked or compromised. The future of data transfer is called quantum networking and it relies on a complex concept that takes the ‘signal’ out of sending data. Hackers can’t intercept or steal data that never travels, so there’s no signal — the source and destination, in quantum networking, are one in the same.
With the new quantum internet, instead of sending information, you’ll create pairs of photons that mirror one another. This is called quantum entanglement. You’ll keep one of the photons, send someone else the other entangled photon, and then anything you do to your photon instantly happens to the other person’s photon.
Painting a smiley face on your photon (which isn’t possible, but helpful in imagining the concept) would result in a smiley face appearing on the other photon — no matter where it was.
The idea is so complex that, despite the fact we’re using it, nobody quite understands it.
Scientists used a fiber-optic cable to send the photons in previous experiments. This approach was revolutionary, but limited. The largest problem with the fiber optics method is that it has a range of around 100 miles. Photons travel through fiber optic cables by bouncing back and forth — this process causes the signal to degrade as it gets further from the source.
The relatively short distance makes the tech promising for city-wide use, but unrealistic for global implementation." Copied
s23bog wrote:
Actually, there are 12 possible pieces. Assuming the squares are arranged in order, then you would need, roughly 4 bits per piece (accounting for castling, en passant, and right to move can be mixed in there somehow with the extra "space").
4x64=256.
256 bits per position.
I'd like to see how quickly a computer could display as many legal positions as possible.
How about you go program it then? You keep spouting ideas but don't do anything with it. You have a background in programming. Go do it, and come back with your findings 
.
seasideman wrote:
No. There are too many permutations for it to ever be solvable.
Wouldn't that be like someone 300 years ago asking if man will ever walk on the moon and replying "no, horses and hot air balloons will never go that far". So maybe horses cant get to the moon, but something else can. And maybe a "computer" cant solve chess, but what about the thing that replaces computers? I think that just because we cant think of a way right now (using current knowledge) doesn't mean a way will not exist in the future.
Jun 22, 2017
0
#1096
Heisenberg's uncertainty principle is not going to be going away, limiting conventional computing speeds.
But quantum computing offers potential for ripping up the book of what is possible.
Jun 22, 2017
0
#1097
lfPatriotGames wrote:
seasideman wrote:
No. There are too many permutations for it to ever be solvable.
Wouldn't that be like someone 300 years ago asking if man will ever walk on the moon and replying "no, horses and hot air balloons will never go that far". So maybe horses cant get to the moon, but something else can. And maybe a "computer" cant solve chess, but what about the thing that replaces computers? I think that just because we cant think of a way right now (using current knowledge) doesn't mean a way will not exist in the future.
AhHa! A fellow sci-fi enthusiast by chance? Being open minded about possibilities heretofore not even considered is what leads to the greatest of discoveries :-)
Jun 23, 2017
0
#1098
It suddenly struck me afresh how amazing it is that humans landed on the Moon, a quarter of a million miles above the ground, 65 years after the first powered flight of a few seconds. Astonishing!
hmm
Jun 23, 2017
0
#1100
s23bog wrote:
It seems like such a tiny accomplishment to me.
It is by far the furthest humans have reached in person. That is significant. The engineering accomplishment was also a huge deal, especially considering the truly crappy computers that were around in those days! The Saturn V was an awesome machine.
I don't think it's mathematically possible, there is simply to many positions.