The Knapsack Problem

From IFWiki

One-room CYOA LOTECH Comp 2001 Entry

The Knapsack Problem
Author(s)	Leonard Richardson
Publisher(s)	n/a
Release date(s)	2001
Authoring system	Inform 6
Platform(s)	Z-code 5
Language(s)	English
License(s)	Freeware
Multimedia
Color	none
Graphics	none
Sound/Music	none
Ratings
Cruelty scale	Cruelty to be determined

Contents 1 How It Begins 2 Notable Features 3 Versions 3.1 Release TBD 4 Links 4.1 General info 4.2 Reviews 4.3 See also

How It Begins

Notable Features

• Not interactive fiction in the traditional sense.
• Names, values, and weights of items are randomized for each gaming session. The solution to the game's main puzzle will be different each time.

Versions

Release TBD

• The Knapsack Problem (Leonard Richardson; 2001; Z-code 5).
  • IFID wanted. (Please replace this line with a babel template.)
  • LOTECH Comp 2001: Entry, unranked from 6 entries.

Links

General info

• The Knapsack Problem - at Baf's Guide.

Reviews

• The Knapsack Problem - at IF Ratings .

See also

For more about the knapsack problem in general:

• Knapsack problem (the problem, not the game) - at Wikipedia.
• "NP-Complete" - xkcd, a webcomic by Randall Munroe, features the knapsack problem in this July 2007 strip.

Classical Conundrums in Math and Science

Spyder and Jeb (1998) The Knapsack Problem (2001) Schroedinger's Cat (2001) Food for Thought (2007)