TalkChess.com
Hosted by Your Move Chess & Games

Author Message
Miguel A. Ballicora

Joined: 09 Mar 2006
Posts: 4436
Location: Chicago, Illinois, USA

Post subject: Re: Court case victory to Chessbase    Posted: Sat Apr 16, 2011 5:48 pm

bob wrote:
michiguel wrote:
bob wrote:
bob wrote:
 bob wrote: Many courts have already ruled that you can _not_ copyright a chess game, because chess games are "enumerable" and one can write a program which, given enough time, can enumerate every possible game of chess that can be played.

Funny, every literary text is enumerable, hope the courts from now on will not allow them to fall under copyright protection, given the Chessbase precedent.

I just wrote such a program and it gave me

"one can write a program which, given enough time, can enumerate every possible game of chess that can be played" in 2 seconds.

Kai

This isn't true. There are an infinite number of possible "literary texts". You can insert words for as long as you want. Chess, however, is finite, because of the rules (most notably the 50 move rule).

Funny again. Admitting that chess is enumerable, the only reason a literary text could not be enumerable is because it could be infinite? Does such text exist? Even this is irrelevant, as you seem to miss my main point. Both chess and MY utterance "I am" are innumerable.

Kai

I have no idea what you are talking about. "I am" can be enumerated easily. 4 loops, nested, each looping over all alpha characters and space, one loop for each of four positions. You get "I am" quickly. But for the general case, you have to have an infinite number of nested loops because there is no rule saying that "once you use N characters, you can't add another. In text, you can _always_ add another. Chess is finite. And I don't want to hear the silly "50 move is optional." Show me a game where 2 players decided to play on beyond 50 moves, _intentionally_. I've played in a ton of tournaments over the years (as a human player and operating a chess program against humans) and I have _never_ seen it happen. Realistically, the game is finite as it is zero-sum.

No, "realistically" (i.e. in practice) the game is infinite. "Theoretically" (i.e. pedantically) the game is finite. But, the argument is really naive even from that point of view, because if you want to be pedantic about the "limited number" of possible games, the optionality of the 50 move rule is a pedantic counter argument.

By the way, this is all silly, because the score could have identical moves, but one has been played by Karpov and Kasparov, and the other by me and a friend. Both games are not the same (the players differ), and the scores are not the same.

Miguel

 Quote: Does an infinite-length exist? Funny. But for any length text you produce, I can produce one that is one word longer... And we _never_ reach a point where that is no longer true. With chess, 3900 moves or so and the game is over.

I do not believe the original court decision was related to players, or locations, or time controls, or any of a dozen other variables, but to a sequence of moves.

Those should be taken into account if you want to copyright the score. The moves alone do not mean anything. That is why it is an absurd argument for the right decision.
 Quote: As far as length goes, what is the longest game ever played? Did it even reach 500 moves? I've not seen one go beyond even 350. I think the "finiteness" of the game is pretty well a fact.

The same could be said about books. There is a practical limit, time for blitz, cellulose and ink for a book.

Miguel
_________________
 Display posts from previous: All Posts1 Day7 Days2 Weeks1 Month3 Months6 Months1 Year Oldest FirstNewest First
Subject Author Date/Time
Graham Banks Fri Apr 15, 2011 8:08 am
Ted Wong Fri Apr 15, 2011 10:53 am
Albert Silver Fri Apr 15, 2011 2:29 pm
Ernest Bonnem Fri Apr 15, 2011 5:03 pm
Albert Silver Fri Apr 15, 2011 5:42 pm
Greg Simpson Fri Apr 15, 2011 6:40 pm
Albert Silver Fri Apr 15, 2011 6:44 pm
Greg Simpson Sat Apr 16, 2011 1:27 am
Albert Silver Sat Apr 16, 2011 3:14 am
Sven Schüle Sat Apr 16, 2011 9:12 am
Greg Simpson Sat Apr 16, 2011 1:10 pm
Albert Silver Sat Apr 16, 2011 2:41 pm
Greg Simpson Sat Apr 16, 2011 8:34 pm
Robert Hyatt Fri Apr 15, 2011 8:38 pm
Kai Laskos Fri Apr 15, 2011 9:00 pm
Steven Atkinson Fri Apr 15, 2011 10:21 pm
Miguel A. Ballicora Fri Apr 15, 2011 10:53 pm
Albert Silver Sat Apr 16, 2011 12:00 am
Dann Corbit Sat Apr 16, 2011 12:27 am
Miguel A. Ballicora Sat Apr 16, 2011 5:27 am
Albert Silver Sat Apr 16, 2011 2:43 pm
Miguel A. Ballicora Sat Apr 16, 2011 4:36 pm
Albert Silver Sat Apr 16, 2011 4:55 pm
Robert Hyatt Sat Apr 16, 2011 1:24 am
Greg Simpson Sat Apr 16, 2011 1:33 am
Robert Hyatt Sat Apr 16, 2011 3:55 pm
Kai Laskos Sat Apr 16, 2011 1:53 am
Alex Brown Sat Apr 16, 2011 2:48 am
Robert Hyatt Sat Apr 16, 2011 4:00 pm
Miguel A. Ballicora Sat Apr 16, 2011 4:33 pm
Robert Hyatt Sat Apr 16, 2011 5:32 pm
Re: Court case victory to Chessbase Miguel A. Ballicora Sat Apr 16, 2011 5:48 pm
Miguel A. Ballicora Sat Apr 16, 2011 4:40 pm
Robert Hyatt Sat Apr 16, 2011 5:34 pm
Miguel A. Ballicora Sat Apr 16, 2011 5:50 pm
Steven Atkinson Fri Apr 15, 2011 8:22 pm
Graham Banks Fri Apr 15, 2011 8:29 pm

 Jump to: Select a forum Computer Chess Club Forums----------------Computer Chess Club: General TopicsComputer Chess Club: Tournaments and MatchesComputer Chess Club: Programming and Technical DiscussionsComputer Chess Club: Engine Origins Other Forums----------------Chess Thinkers ForumForum Help and Suggestions
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