lootsack.1

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
.Dd $Mdocdate: May 17, 2024 $
.Dt lootsack 1
.Os
.Sh NAME
.Nm lootsack
.Nd Knapsack problem as a treasure-hauling dilemma.
.Sh SYNOPSIS
.Nm lootsack
.Op Fl v
.Op Fl w Ar weight
.Op Fl i Ar inputfile
.Sh DESCRIPTION
The
.Nm lootsack
program looks for a solution to the knapsack problem
to haul away as much treasure as possible. Specify a max weight using
.Fl w
and an input file previously generated by
.Cm lootsack-generate
to calculate an answer.

.Bl -tag -width Ds
.It Fl v
Enable verbose output.
.It Fl w Ar weight
Specify the maximum weight allowed for a solution to be considered feasible.
.It Fl i Ar inputfile
Read the treasure pile definition from the indicated binary treasure file.
.El

.Sh EXIT STATUS
.Nm
will exit with a non-zero value in the event of an error.

.Sh AUTHORS
.An Ron Dahlgren
.Mt ron@sw.gy