خوشم میاد از این آرش سبحانی، خیلی قشنگ خودش رو با شرایط روز تطبیق میده، یعنی این حس بویایی قویای که داره قابل تحسینه - http://www.shahrvand.com/wp-cont...
اون آلبوم اولش خودش اعتراف کرده بود که عمدا سعی میکنه شبیه مارک نافلر بزرگ موزیک بسازه و بخونه. اما این کجا و اون کجا
- دُن ورتیگونه
به نظرم هنرمند باید هر دو رویکرد رو با هم پی بگیره. اگه صرفن بر اساس مسائل روز جلو بره و به قول معروف واکنشی رفتار کنه، خواه ناخواه برای هنرش تاریخ مصرف تعیین کرده. چیزی شبیه بسیاری از آثار سینمای شوروی سابق که با وجودی که خوش ساخت بودن ولی چون جزوی از پروپاگندای دستگاه حاکم بودند الان جذابیت خاصی ندارن چون مبلغ صرف ِ خدمات شوروی به روستاها و کشاورزان و ... و آبادسازی های دولت شوروی بودند و بس
- آریــوبرزن
DETROIT (AP) -- Brad Penny pitched eight scoreless innings with the help of some terrific Detroit fielding, and the Tigers beat the Kansas City Royals 3-0 on Saturday for their seventh straight victory.......
- nc
Arsenal came through an FA Cup tie that will bear no resemblance to the quarter-final, even though Leyton Orient attacked when feasible and might have scored. The encounter with Manchester United on 12 March will have the air of an entirely different tournament. Even so, this encounter had its uses. Nicklas Bendtner took a hat-trick as goals flowed for a club that will have welcomed a soothing return to action. The one indestructible aspect of Arsène Wenger's Arsenal is its well-deserved reputation for fragility. That factor was demonstrated once more in the Carling Cup final, where the trophy went to Birmingham City. There had been no defeat against those opponents since 2005, yet fallibility flooded Arsenal minds when there was a prize at stake. The debacle provided a backdrop of sorts to this replay, but the associations with the woe of Wembley were few. Even if he had not been affected by a string of injuries, the manager would have made radical alterations with confidence that...
- welovearsenal
"Good point! The naive search algorithm you describe is indeed simpler, both in terms of lines of code and in conceptual complexity. And for many puzzles, it arrives at the solution in less than a second, so it has a lot to recommend it. But for other puzzles, it takes many minutes. Consider the puzzle I show above, which you would encode as [4, 0, 0, 0, 0, 0, 8, 0, 5, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 8, 0, 4, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 6, 0, 3, 0, 7, 0, 5, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 4, 0, 0, 0, 0, 0, 0] I started to run this with your code, but after 20 minutes it still hadn't completed and I interrupted the process. The algorithm I describe is over 10,000 times faster on hard puzzles like this. That's why I dismissed the naive search approach, although I should have covered it in my article."
- Peter Norvig