Content deleted Content added
Capewearer (talk | contribs) No edit summary |
Citation bot (talk | contribs) Add: issue, year, author pars. 1-2. | You can use this bot yourself. Report bugs here. | Activated by User:Zppix | Category:Artificial intelligence | via #UCB_Category |
||
Line 57:
The Cyc TPTP Challenge is a competition to develop reasoning methods for the [[Cyc]] comprehensive ontology and database of everyday common sense knowledge.<ref>{{cite web|url=http://www.opencyc.org/doc/tptp_challenge_problem_set|archiveurl=https://web.archive.org/web/20120319123128/http://www.opencyc.org/doc/tptp_challenge_problem_set|url-status=dead|archivedate=2012-03-19|title=The Cyc TPTP Challenge Problem Set|website=opencyc.org}}</ref> The prize is 100 euros for "each winner of two related challenges".<ref>{{cite web|url=http://www.opencyc.org/announce/Cyc%20ATP%20Challenges%20at%20CASC-J4|archiveurl=https://web.archive.org/web/20120216063326/http://www.opencyc.org/announce/Cyc%20ATP%20Challenges%20at%20CASC-J4|archivedate=2012-02-16|url-status=dead|title= Cyc ATP Challenges at CASC-J4! |website=opencyc.org}}</ref>
The [[Eternity II]] challenge was a [[constraint satisfaction]] problem very similar to the [[Tetravex]] game. The objective is to lay 256 tiles on a 16x16 grid while satisfying a number of constraints. The problem is known to be [[NP-complete]].<ref>{{cite journal | doi = 10.1016/j.ipl.2006.04.010 | volume=99 | title=Tetravex is NP-complete | journal=Information Processing Letters | year=2006 | pages=171–174| arxiv=0903.1147 | last1=Takenaga | first1=Yasuhiko | last2=Walsh | first2=Toby | issue=5 }}</ref> The prize was US$2,000,000.<ref>http://uk.eternityii.com/competition-rules-eternity-2/</ref> The competition ended in December 2010.
==Games==
| |||