{"id":1630,"date":"2015-08-23T22:54:28","date_gmt":"2015-08-24T05:54:28","guid":{"rendered":"http:\/\/zackmdavis.net\/blog\/?p=1630"},"modified":"2015-09-28T22:45:11","modified_gmt":"2015-09-29T05:45:11","slug":"no-award","status":"publish","type":"post","link":"http:\/\/zackmdavis.net\/blog\/2015\/08\/no-award\/","title":{"rendered":"No Award"},"content":{"rendered":"<p>Nothing should dilute or adulterate the exalted joy of watching the chess engine you've toiled over for the better part of three weekends start to suggest moves (from a basic 3-ply negamax search with a simple <a href=\"https:\/\/en.wikipedia.org\/wiki\/Chess_piece_relative_value\">point<\/a>-counting position evaluation heuristic), unless it's the slight(ly overdetermined?) suspicion that you're overcompensating for something, that you've proved your point by now, that bringing yet another moderately-sophisticated side project in a <a href=\"http:\/\/www.paulgraham.com\/pypar.html\">not-the-most-popular<\/a> programming language over the threshold of &quot;really cool-looking proof-of-concept&quot; isn't going to show Everyone that you are Smart and should be Respected any <em>more<\/em> than the last seven already did. Some people actually <em>use<\/em> software for something other than a trophy, to automate some aspect of the world that otherwise would have been done more poorly. So you've heard. If one were to hypothesize, for the sake of argument (but perhaps not <em>only<\/em> for the sake of argument) that there can exist diminishing marginal returns to some games, that Respect from Everyone is not a real thing that can be won, that there are treasures and masteries you'd never imagine while chasing GitHub stars, much like how <em>you<\/em> know there are treasures and masteries that you'd never imagine while chasing school marks\u2014what strategies would that imply, now that you know there is such a thing as being strategic? And how would you tell the difference?<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Nothing should dilute or adulterate the exalted joy of watching the chess engine you've toiled over for the better part of three weekends start to suggest moves (from a basic 3-ply negamax search with a simple point-counting position evaluation heuristic), &hellip; <a href=\"http:\/\/zackmdavis.net\/blog\/2015\/08\/no-award\/\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[1],"tags":[],"_links":{"self":[{"href":"http:\/\/zackmdavis.net\/blog\/wp-json\/wp\/v2\/posts\/1630"}],"collection":[{"href":"http:\/\/zackmdavis.net\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/zackmdavis.net\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/zackmdavis.net\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/zackmdavis.net\/blog\/wp-json\/wp\/v2\/comments?post=1630"}],"version-history":[{"count":2,"href":"http:\/\/zackmdavis.net\/blog\/wp-json\/wp\/v2\/posts\/1630\/revisions"}],"predecessor-version":[{"id":1644,"href":"http:\/\/zackmdavis.net\/blog\/wp-json\/wp\/v2\/posts\/1630\/revisions\/1644"}],"wp:attachment":[{"href":"http:\/\/zackmdavis.net\/blog\/wp-json\/wp\/v2\/media?parent=1630"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/zackmdavis.net\/blog\/wp-json\/wp\/v2\/categories?post=1630"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/zackmdavis.net\/blog\/wp-json\/wp\/v2\/tags?post=1630"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}