source:
vis_dev/vis-2.1/examples/eight_queens/README
@
12
Last change on this file since 12 was 11, checked in by , 13 years ago | |
---|---|
File size: 296 bytes |
Line | |
---|---|
1 | |
2 | eight_queens.v: |
3 | |
4 | This example illustrates a reduction of the 8 queens problem to |
5 | combinational equivalence checking. In particular, the design |
6 | in eight_queens.v computes a 64 input, single output boolean function |
7 | which is true iff the input is a valid positioning of queens |
8 | on the chessboard. |
9 |
Note: See TracBrowser
for help on using the repository browser.