| Advanced Search | ||
|---|---|---|
 | Chapter 6. Problem Search and Custom Problem Sets |  |
| Advanced Search | ||
|---|---|---|
| | Chapter 6. Problem Search and Custom Problem Sets | |
Advanced search allows premium users to have greater control over the problem search, it includes criteria for problem specific features, including criteria related to previous attempts on the problems.
The number of pieces, colour to move and game move number search criteria can be useful when combined with the opening name/ECO code search criteria, allowing you to choose tactics from games that used your opening of choice, and concentrate on the tactics that actually appeared in the opening phase of the game, rather than middle game/endgame positions that happened to arise out of the opening you searched for.
The number of moves in the tactic. These are full moves, for tactics they are measured as the number of moves the solver must make to complete the problem. For endgames the number of moves is the fastest number of moves to reach mate. Due to pruning, the endgame problems often reach completion before mate is achieved.
This is the total number of times a problem has been attempted using the selected rating type. This number is across all solvers, not just the attempts of the person doing the search.
This allows use to select tactic problems based on their tag, such as Fork, Pin etc. To see this option, blitz or standard rating type must be selected. Multiple tags can be selected. The tag vote threshold can be set, which is the minimum vote sum required for a tag to match. Setting a higher vote threshold means more users had voted for the tag, thus is more likely to be correct, but will also reduce the total number of matching problems.
This allows use to select endgame problems based on the endgame type, for example, KRPKR is the Rook and Pawn versus Rook endgame. To see this option, theory or practice rating type must be selected. Multiple endgame types can be selected. The numbers shown in brackets after each endgame type is the number of problems for that type.
Specifies if winning, non-winning, or both types of tactics problems are included in a problem search. Non-winning tactics are those that leave you close to even, and other moves would lead to a losing or lost position.
The outcome option indicates if you want matching problems to be mates, non-mates or either. This options is only useful for tactics problems, as all endgames are deemed to be 'mates'.
The quality range option allows you to select problems based on their quality rating.
The colour of the pieces controlled by the player solving the problem.
The number of pieces on the board at the start of the problem.
The move number in the source game at which the problem starts.
Matches only problems with the supplied search string in one of their problem comments. For example "boden" would return problems where people had discussed Boden's mate (likely because the problem itself was of that type).
The attempts criteria of the advanced search allows you specify problems based on the nature of your previous attempts against them.
This is the default option, and matches any problem, irrespective of your past history with the problem.
This option specifies that you want to match problems you've made mistakes on in the past. This option will match any number of mistakes, and will still match problems you may have gotten correct on subsequent attempts.
This option matches problems you have correctly solved in the past. It includes problems you've got wrong, as long as you've got them correct at least once.
This criteria matches problems you have attempted in the past, irrespective of the outcome.
This option only matches problems you have never attempted in the past.
This option matches problems you have not got correct, it is a combination of problems you have never tried, and problems you may have tried, but never been able to solve correctly.
The criteria matches problems that you have done in the past, but never been able to solve correctly. This criteria is very useful when creating custom sets designed to review past mistakes.
The problem set attempts criteria can be chosen to apply to all problems, or a subset of problems. All problems is the default , and includes any problem, both rated and unrated. The other options are blitz, standard, theory and practice attempts. If for example you choose standard and apply the 'Problems I always got wrong' then this will match only problems you got wrong in standard mode.
Solve time ranges of the problem attempts can also be chosen, here the solve time is the shortest solve time across all attempts, and is defined in number of seconds. You also choose to include all as yet unsolved problems in the search , which is useful if you want to solve a set of problems until you can solve them all under a specified minimum solve time. You can also choose to only use the most recent solve time for the solve time matching. This allows you to include problems that you may have solved quickly in the past, but where your most recent attempt was slower. Without using the "Use most recent time" option,the time that is matched is the shortest time across all problem attempts.
How recently you have seen a problem can also be used an attempt filter criteria by entering a "Days since last seen" range. For example setting this to 0-31 would only give you problems you had seen in the last month. Setting it to 31-365 would only give you problems you hadn't seen for at least a month, but had seen within the last year.
The ordering options allow you to control what order problems are served up from a custom set. A sort criteria and sort order (ascending or descending) can be defined. When you reach the end of an ordered set, the set is reset to start from the beginning, and you can continue to solve any problems left in the set.
The following ordering options are available:
This is the default ordering, and will serve up matching problems in random order.
Sort custom sets by problem rating. Combined with ascending sort direction, this option provides an effective way of creating custom sets that get more difficult as you go through the problems.
Sorts set by the number of times you have got each problem correct.
Sorts custom sets by the number of times you have got each problem wrong. By also choosing descending sort direction, this allows you to be served the problems you've had the most difficulty with first.
Sorts custom sets by the number of times you have done each problem. By using ascending sort order, you can use this option to be served unseen problems before those you have seen before.
Allows ordering problems by how long it is since you have seen them. For example when setting the sort direction to ascending you will see the problems whose most recent attempts were the furthest into the past.
Sorts problems based on the fastest time you have solved them in the past. Using a descending sort direction allows you to do the problems you've taken the longest on first.
Sorts problem sets by the number of moves in the problem. The most common use of this criteria is to combine it with outcome type "mate", to create custom sets that first give you mate in 1 problems, and then mate in 2 problems etc.
| |  | |
| Basic Search |  | Advanced Search - Source Game Criteria |