comments
Respond
Comment on the article
Add a citation
Reply with an article
Start a new topic
Edit
Edit article
Delete article
Share
Invite
Link
Embed
Social media
Avatar
View
Graph
Explorer
Focus
Down
Load 1 level
Load 2 levels
Load 3 levels
Load 4 levels
Load all levels
All
Dagre
Focus
Down
Load 1 level
Load 2 levels
Load 3 levels
Load 4 level
Load all levels
All
Tree
SpaceTree
Focus
Expanding
Load 1 level
Load 2 levels
Load 3 levels
Down
All
Down
Radial
Focus
Expanding
Load 1 level
Load 2 levels
Load 3 levels
Down
All
Down
Box
Focus
Expanding
Down
Up
All
Down
Article ✓
Outline
Document
Down
All
Page
Canvas
Time
Timeline
Calendar
Updates
Subscribe to updates
Get updates
Past 24 hours
Past week
Past month
Past year
Pause updates
Contact us
Computers play expert chess using heuristic search
Chess programs play expert-level chess using advanced search techniques and heuristics.
RELATED ARTICLES
Explain
⌅
Artificial Intelligence
Artificial Intelligence☜A collaboratively editable version of Robert Horns brilliant and pioneering debate map Can Computers Think?—exploring 50 years of philosophical argument about the possibility of computer thought.☜F1CEB7
⌃
Can computers think? [1]
Can computers think? [1]☜Can a computational system possess all important elements of human thinking or understanding? ☜FFB597
⌃
Yes: physical symbol systems can think [3]
Yes: physical symbol systems can think [3]☜Thinking is a rule governed manipulation of symbolic representational structures. In humans, symbol systems are instantiated in the brain, but the same symbol systems can also be instantiated in a computer. ☜59C6EF
⌃
The Heuristic Search Assumption
The Heuristic Search Assumption☜Symbolic data is searched using various methods of estimation or heuristics, which make the search more efficient.☜98CE71
■
Computers play expert chess using heuristic search
Computers play expert chess using heuristic search☜Chess programs play expert-level chess using advanced search techniques and heuristics.☜98CE71
↳
Deep Blue - Implemented Model
Deep Blue - Implemented Model☜The chess-playing computer Deep Blue—an IBM parallel computer running 256 chess processors allowing it to consider 50-100bn moves in three minutes—beat world champion Garry Kasparov in two out of 6 games at a match in 1996.☜98CE71
↳
Deep heuristic search can achieve expert performance
Deep heuristic search can achieve expert performance☜Deep Thought—the precursor to Deep Blue—plays chess at grandmaster level via deep heuristic search and considering more moves than any previous system.☜98CE71
↳
Heuristic search is inconsistent with human phenomenology
Heuristic search is inconsistent with human phenomenology☜Human experts play chess by zeroing in on relevant moves in fringe consiciousness rather than by iterating through a list of possiblities.☜EF597B
□
Combinatorial Explosion of Search
Combinatorial Explosion of Search☜When the number of paths in a search space grows exponentially, a combinatorial explosion results: the search becomes too long to be carried out, given time and money constraints—even though search heuristics can improve efficiency.☜EF597B
□
Trail and Error different from essential discrimination
Trail and Error different from essential discrimination☜Humans can intuitively grasp whats essential or inessential about a problem and zero in on it. Symbol systems lack the capacity for essential discrimination and proceed blindly by brute-force trail and error.☜EF597B
□
Graph of this discussion
Graph of this discussion☜Click this to see the whole debate, excluding comments, in graphical form☜dcdcdc
Enter the title of your article
Enter a short (max 500 characters) summation of your article
Click the button to enter task scheduling information
Open
Enter the main body of your article
Prefer more work space? Try the
big editor
Enter task details
Message text
Select assignee(s)
Due date (click calendar)
RadDatePicker
RadDatePicker
Open the calendar popup.
Calendar
Title and navigation
Title and navigation
<<
<
July 2024
>
<<
July 2024
S
M
T
W
T
F
S
27
30
1
2
3
4
5
6
28
7
8
9
10
11
12
13
29
14
15
16
17
18
19
20
30
21
22
23
24
25
26
27
31
28
29
30
31
1
2
3
32
4
5
6
7
8
9
10
Reminder
No reminder
1 day before due
2 days before due
3 days before due
1 week before due
Ready to post
Copy to text
Enter
Cancel
Task assignment(s) have been emailed and cannot now be altered
Lock
Cancel
Save
Comment graphing options
Choose comments:
Comment only
Whole thread
All comments
Choose location:
To a new map
To this map
New map options
Select map ontology
Options
Standard (default) ontology
College debate ontology
Hypothesis ontology
Influence diagram ontology
Story ontology
Graph to private map
Cancel
Proceed
+Comments (
0
)
- Comments
Add a comment
Newest first
Oldest first
Show threads
+Citations (
0
)
- Citations
Add new citation
List by:
Citerank
Map
+About
- About
Entered by:-
David Price
NodeID:
#471
Node type:
SupportiveArgument
Entry date (GMT):
7/6/2006 12:03:00 PM
Last edit date (GMT):
12/12/2007 12:59:00 PM
Show other editors
Incoming cross-relations:
0
Outgoing cross-relations:
0
Average rating:
0
by
0
users
Enter comment
Select article text to quote
Cancel
Enter
welcome text
First name
Last name
Email
Skip
Join
x
Select file to upload