State space search
algorithms, complexity, and applications
Our rough guess is there are 50,250 words in this book.
At a pace averaging 250 words per minute, this book will take 3 hours and 21 minutes to read. With a half hour per day, this will take 7 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Word Count
50,250 words, Guess
Page Count
201 pages
Identifiers
- Open LibraryOL37544M
- ISBN-100387988327
- OCLC Control Number40996157
- OCLC Control Numberstatespacesearch0000zhan
- Library of Congress Control Number99024756
and 1 more
- Goodreads3438829
Classifications
- DDC519.7/6
- LCCQA402 .Z475 1999
Description
"This book examines state-space search, for combinatorial optimization, one of the fundamental problems of computer science and operations research. In particular, it focuses on heuristic state-space search algorithms, including best-first search, depth-first branch-and-bound, iterative deepening, recursive best-first search, and space-bounded best-first search."--BOOK JACKET.
Subjects
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!