1 / 2

Busting the king’s gambit

CS10 : The Beauty and Joy of Computing Lecture #19 Higher Order Functions II 2012-04-04. UC Berkeley EECS Lecturer SOE Dan Garcia.

step
Download Presentation

Busting the king’s gambit

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS10 : The Beauty and Joy of ComputingLecture #19Higher Order Functions II 2012-04-04 UC Berkeley EECSLecturer SOEDan Garcia The popular opening 1. e4 e5 2. f4 exf4 refutes the “formerly popular opening”. He “strongly solved” it using ~3,000 cores powered by the IBM Watson team, and finds out that there’s only ONE move that draws for white 3. Be2; every other move “loses by force”. (they consider a game in which a person is down by 5.12 points to be a loss) (Image Credit: chessbase.com) Busting the king’s gambit http://www.chessbase.com/newsdetail.asp?newsid=8047

  2. Today • Review useful HOFs • map Reporter over List • Report a new list, every element E of Listbecoming Reporter(E) • keep items such that Predicate from List • Report a new list, keeping only elements Eof List if Predicate(E) • combine with Reporter over List • Combine all the elements of List with Reporter(E) • This is also known as “reduce” • Acronym example • keep  map  combine • The script, run and launch • For each • Compose example

More Related