@@ -12,35 +12,35 @@ left on the board, ideally in the center location.
1212
1313![ Solitaire board] ( https://upload.wikimedia.org/wikipedia/commons/thumb/5/50/Spielzug_von_Solit%C3%A4r.gif/330px-Spielzug_von_Solit%C3%A4r.gif )
1414
15- - [ Solutions] ( solutions/index.md )
15+ - [ Solutions] ( https://github.com/Dampfwalze/solitaire_solver/blob/master/ solutions/index.md)
1616- [ Documentation] ( https://dampfwalze.github.io/solitaire_solver )
1717
1818This project implements two board representations and two solving schemes,
1919namely breadth-first and depth-first search.
2020
2121## Board representations
2222
23- ### [ ` list_board::Board ` ] ( src/board/list_board.rs )
23+ ### [ ` list_board::Board ` ]
2424
2525The board is represented with an array of 33 booleans, where each boolean
2626represents a location on the board. The array is densly packed, so every element
2727of the array represents a location on the board.
2828
29- ``` rust
29+ ``` rust,no_run
3030struct Board([bool; 33]);
3131```
3232
33- ### [ ` bit_board::Board ` ] ( src/board/bit_board.rs )
33+ ### [ ` bit_board::Board ` ]
3434
3535The board is represented with one ` u64 ` , where its bytes represent the rows of
3636an 8x8 bit matrix. Only 7x7 locations are actually used up by the board, like
3737so:
3838
39- ``` rust
39+ ``` rust,no_run
4040struct Board(u64);
4141```
4242
43- ```
43+ ``` text
4444 0 1 2 3 4 5 6 7 bits
45450 . . ● ● ● . . .
46461 . . ● ● ● . . .
@@ -52,3 +52,6 @@ struct Board(u64);
52527 . . . . . . . .
5353bytes
5454```
55+
56+ [ `list_board::Board` ] : https://dampfwalze.github.io/solitaire_solver/solitaire_solver/board/list_board/struct.Board.html
57+ [ `bit_board::Board` ] : https://dampfwalze.github.io/solitaire_solver/solitaire_solver/board/bit_board/struct.Board.html
0 commit comments