C++ Search Algorithms Library - Tasks: task #4018, BFMS
You are not allowed to post comments on this tracker with your current authentication level.
task #4018: BFMS
Submitter: | Carlos Linares López <clinares> | ||
Submitted: | Sat 16 Apr 2005 10:29:30 PM UTC | ||
Category: | Two-player search algorithms | Should Start On: | Sun 10 Dec 2006 11:00:00 PM UTC |
Should be Finished on: | Sat 23 Dec 2006 11:00:00 PM UTC | Severity: | 5 - Blocker |
Priority: | 7 - High | Status: | Postponed |
Privacy: | Public | Assigned to: | elakasta |
Percent Complete: | 0% | Open/Closed: | Open |
No files currently attached
Depends on the following items: None found
Items that depend on this one: None found
Carbon-Copy List
There are 0 votes so far. Votes easily highlight which items people would like to see resolved in priority, independently of the priority of the item set by tracker managers.
Follow 5 latest changes.
Date | Changed by | Updated Field | Previous Value | => | Replaced by |
---|---|---|---|---|---|
2007-06-04 | elakasta | Status | None | Postponed | |
2006-11-17 | elakasta | Should Start On | 2005-04-16 | 2006-12-10 | |
Should be Finished on | 2005-04-16 | 2006-12-23 | |||
2006-11-16 | clinares | Priority | 5 - Normal | 7 - High | |
2005-04-16 | clinares | Severity | 3 - Normal | 5 - Blocker |
Powered by Savane 3.13-4b48.
Corresponding source code
Richard Korf recently introduced some ideas for improving the smartness of two-player search algorithms by introducing some sort of selectivity or capability for chosing the most likely lines to occur.
BFMS consists of two different algorithms: the simple and extended. Both shall be programmed.