benwh1
benwh1
### Summary Haven't been able to trigger it when using any struct that doesn't contain some sort of function. On stable, doesn't occur on 1.62.1, does occur on 1.63.0. [Playground...
- OS version: Windows 10, Linux Mint 20 - Editor version: 1.66.2 - Programming language: Rust - TabNine extension version: 3.5.45 I recently disabled tabnine because when I was using...
The distribution of the pieces is not uniform and the scrambles are easier than they should be. I generated 500 scrambles, and they had an average optimal solution length of...
e.g. D2 R U L D R U2 L D R D L U R2 U R D L2 U R2 D L3 U R D2 **R U2 D2 R**...
### Bug Description The code below does not compile on nightly-2024-04-05 or later. ### Minimal Reproduction ```rust use sqlx::Type; #[derive(Type)] struct Foo { a: i32, } fn main() {} ```...
in case of power outages, etc.
instead of rewriting the table after each depth. Maybe also write on Ctrl+C, if we decide that waiting for it to finish would take too long?
because large tables can be very slow to load (sometimes up to 20 minutes for a 128gb table on my machine).
If I run `twsearch --mindepth 40 puzzle.tws scramble.scr`, I would expect the pruning table to be generated out to the same depth that it would be if a full search...
Based on the parity of the permutations defining the moves, check whether there are any parity constraints that make it impossible to have an even length solution and an odd...