JanecekPetr

Mister White follows up on his ideas, but this seems to be unnecessary, at least from what I saw at his concert in Prague, Czech Republic, last year.

Before the show one of his crewmen said to all the people to keep their phones in the pockets, that the show will be profesionally photographed and the photos will be on the official Jack White site for everyone to download.

This helped immensely, and I'd guess 95 % of the people kept heir phones hidden and enjoyed the show. Yes, there still were some who recorded alllllll the songs, but that's their apparently their thing afterall, isn't it? I think this approach was nice, human, and worked very well.

This guy's blog is awesome. A lot of in-depth information, original research, nice and funny writing style. I hope he finds some time to write / speak more soon.

Nice read! Today Cliff Click's NonBlockingHashMap officially lives here https://github.com/JCTools/JCTools/blob/master/jctools-core/...

Additionally to what everyone said already, I have two other uses:

1) I have a set of bookmarks specialized for search. Chrome can do this without bookmarks, but Firefox needs them. I'm talking about bookmarks like this: https://www.google.com/search?q=%s&tbm=isch

Note the %s in the middle, that's where queries go. When you save this as a bookmark and add a keyword to it ("gg" in my case), you can then search images on Google like this:

- Alt-d (jump to url bar)

- gg fluffy kittens

I have a few dozen of these: Google, G images, G translate, G maps, local maps, Wikipedia English, Wikipedia Czech, various dictionaries, whois, wolfram alpha, grammar check, YouTube, Maven search... You get the idea.

2) A huge curated collection of bookmarks to Java libraries. Something similar to all those awesome-java collections that are lately popping up, but more complete, in my browser, indexed for search and neatly grouped into like a hundred folders.

This is great! In a bigger team and/or with an old application, I tend to do these changes manually, all the time, for every piece of code I touch. And while in the long run things get better, it's inevitably a losing battle if the others don't care. Thank you for putting your time into this project!

"...the Impossible Boomerang Attack (IBA) which are especially dangerous as impossible boomerangs are truly impossible while regular boomerangs are possible boomerangs"

wutlol

There's more. Probably just a cheesy way to write a paper you'll retract / rewrite anyway?

I haven't read the source code yet, so this might be off right of the bat. But from the general knowledge of minmax I think the end-game code might need some tweaking.

If there is a guaranteed win, the algorithm will find it. However, if there isn't any, how does it pick a path when it thinks it will lose every time? Are all losses equal to each other? Are some better than the others? Could the elgorithm take the path with best chances where the most of the plays end up winning while only a few of them end up losing?