Back to Results
First PageMeta Content
Game theory / Computer chess / Logistello / Evaluation function / Minimax / Mathematical optimization / Heuristic function / Artificial neuron / Supervised learning / Game artificial intelligence / Games / Artificial intelligence


Improving Heuristic Mini-Max Search by Supervised Learning Michael Buro NEC Research Institute, Princeton NJ 08540, USA 1
Add to Reading List

Document Date: 2009-03-28 16:22:33


Open Document

File Size: 267,92 KB

Share Result on Facebook

Company

IBM / Garry Kasparov / /

Country

United States / /

/

Facility

Supervised Learning Michael Buro NEC Research Institute / NEC Research Institute / /

IndustryTerm

anthropomorphic solutions / large systems / fullwidth search / large neural networks / e.g. meiosis networks / quiescence search / deep search result / satisfactory solution / feed forward networks / conventional hardware / good solutions / selective search / ordinary hardware / deep search / mini-max algorithms / neural networks / performance applications / shallow search result / shallow search / game-tree search / look-ahead search / selective search heuristic / larger search space / mini-max algorithm / search tasks / search speed / particular applications / brute-force search requiring / heuristic game-tree search / purpose chess chips / search algorithm / search results / /

OperatingSystem

Linux / /

Organization

Supervised Learning Michael Buro NEC Research Institute / NEC Research Institute / /

Person

Garry Kasparov / Hans Berliner / Takeshi Murakami / /

/

Position

author / human player / chess player / Forward / player / front runner / programmer / /

Product

Othello / /

Technology

artificial intelligence / search algorithm / Linux / mini-max algorithms / machine learning / purpose chess chips / mini-max algorithm / /

SocialTag