バックトラッキング
1. back-tracking
2. BacktrackingBacktracking is a general algorithm for finding all (or some) solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c ("backtracks") as soon as it determines that c cannot possibly be completed to a valid solution. The classic textbook example of the use of backtracking is the eight queens puzzle, that asks for all arrangements of eight queens on a standard chessboard so that no queen attacks any other.
Read “Backtracking” on English Wikipedia
Read “バックトラッキング” on Japanese Wikipedia
Read “Backtracking” on DBpedia
Read “Backtracking” on English Wikipedia
Read “バックトラッキング” on Japanese Wikipedia
Read “Backtracking” on DBpedia
Discussions
Log in to talk about this word.