You're looking at Less Wrong's discussion board. This includes all posts, including those that haven't been promoted to the front page yet. For more information, see About Less Wrong.

Eugine_Nier comments on Does Checkers have simpler rules than Go? - Less Wrong Discussion

14 Post author: jkaufman 13 August 2013 02:09AM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Article Navigation

Comments (46)

Comments (46)

You are viewing a single comment's thread. Show more comments above.

Comment author: Eugine_Nier 16 August 2013 05:17:51AM 1 point [-]

Well, only three of your practices have anything to do with compression.

Comment author: itaibn0 16 August 2013 02:46:15PM 4 points [-]

I believe his imagined compression scheme compresses variables so that when there are N variables in scope, it takes log(N) bits to refer to a variable, and similarly for methods.

Comment author: Daniel_Burfoot 16 August 2013 10:34:04PM *  2 points [-]

If the source code compressor is well-written (and specialized to the language in question), then the programmer can achieve compression by using the practices mentioned above. itaibn0 has the right idea.

Powered by Reddit Powered by Reddit