Livejournal
Log in
Post
Friends
My journal
louisedennis
Addressing NP-Complete Puzzles with Monte-Carlo Methods
louisedennis
Apr 06, 2008 17:34
Maarten Schadd (with co-authors Mark Winands, Jaap van den Herik and Huib Aldewereld) gave a talk whose primary interest, from my POV, was that the bricks breaking game on Facebook is NP-Complete (
Read more...
)
aisb
,
academia:talks
,
facebook
,
computer science:np problems
Leave a comment
Up