Cited By
View all- Rosin C(2014)Game playingWIREs Cognitive Science10.1002/wcs.12785:2(193-205)Online publication date: 7-Feb-2014
Years of work have gone into algorithms and optimizations for two-player perfect-information games such as Chess and Checkers. It is only more recently that serious research has gone into games with imperfect information, such as Bridge, or game with ...
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all ...
Association for Computing Machinery
New York, NY, United States
View or Download as a PDF file.
PDFView online with eReader.
eReaderView this article in digital edition.
Digital EditionView this article on the magazine site (external)
Magazine SiteCheck if you have access through your login credentials or your institution to get full access on this article.
Sign in