I’ve discovered a funny thing when I was searching some information about EnableUrlSmashing (I love the name), Microsoft created in 2006, published in 2008, a patent about the search API in SharePoint.

That patent ("Simplified search interface for querying a relational database") covers the Query, KeyWordQuery class and more.

An extract from the abstract:

Methods and computer-readable media are provided for performing a search on a relational database. According to one method, a query class is provided that includes properties that specify how a query is to be performed and how results from the query are to be returned, and an execute method that is called to perform the actual query. A keyword query class derived from the query class is also provided that includes keyword query properties and an execute method for performing the keyword query.

Link to the full patent: http://www.freepatentsonline.com/y2008/0114745.html

After Kasparov Vs Deep-Blue, a super computer as beaten another professional board player, but the big difference this time is the game! It was a Go game!

The game was played the 7th of August at the U.S. Go Congress, MoGo(software) running on Huygens(hardware) won against Kim MyungWan (8 dan of Go, it means that is a top top player

Huygens is far more powerful than Deep-Blue with floating point processing power of 15 Teraflop (more than 1000 times).

The big difference between playing chess and go, is the complexity of the game, the number of possible position on a Goban (the Go board) is 2.08168199382×10^{170 ,}

For more informations reads the links below:

Read about Go on wikipedia: http://en.wikipedia.org/wiki/Go_(board_game)

Go complexity: http://en.wikipedia.org/wiki/Go_complexity

The site of the project: http://www.cs.unimaas.nl/g.chaslot/muyungwan-mogo/

And probably one the best site about go (news, game,…): http://gobase.org/