article

Free Access

Backtracking: and the winner is...

Author:
Christopher Welty

View Profile

Authors Info & Claims

intelligence Volume 11 Issue 4Dec. 2000https://doi.org/10.1145/355137.355145

Published:01 December 2000Publication History

Check for updates on crossmark

intelligence

Abstract

No abstract available.

Index Terms

Backtracking: and the winner is...
1. General and reference
  1. Document types

Recommendations

Backtracking tactics in the backtrack method for SAT

Backtrack is an exhaustive search method by consecutively extending partial solutions. Backtracking is a step of backtrack, which occurs when extensions cannot go deeper. So far, people have taken the depth-first backtracking tactic as default in ...
Read More
Nonsystematic backtracking search
Read More
Artificial intelligence researchers: Alan Turing, Marvin Minsky, Seymour Papert, Joseph Weizenbaum, Kevin Warwick, Ray Kurzweil
Read More

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Published in

intelligence Volume 11, Issue 4
Dec. 2000
48 pages
ISSN:1523-8822
EISSN:1557-9425
DOI:10.1145/355137
Issue’s Table of Contents

Copyright © 2000 ACM
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
- Published: 1 December 2000
Permissions
Request permissions about this article.
Request Permissions

Check for updates
Qualifiers
- article
Conference
Funding Sources
Other Metrics
View Article Metrics

Article Metrics
- 0
  Total Citations
  View Citations
- 204
  Total Downloads
- Downloads (Last 12 months)10
- Downloads (Last 6 weeks)3
Other Metrics
View Author Metrics
Cited By
This publication has not been cited yet

PDF Format

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format .

View HTML Format

View Issue’s Table of Contents