The Knapsack Problem

From IFWiki
Jump to: navigation, search
One-room
One-room
CYOA
CYOA

The Knapsack Problem
Not Quite an Abuse of the Z-Machine
Copyright 2001 Leonard Richardson

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

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 1 (LOTECH entry)

Release 3 (Post-comp)

  • The Knapsack Problem (Leonard Richardson; 14-Aug-2001; Z-code 5).
    • Release 3 / Serial number 010814
    • IFID wanted. (Please replace this line with a babel template.)
    • Download knapsack.z5 from the author's site.

Links

General info

Reviews

Spoilers

  • Download knapsack-R3.tgz. Source code (Inform 6 and Python) for Release 3, from the author's site.

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)


Pushpin.jpg

>examine page
The dreadful truth is, this page is incomplete.

This article is a game stub. You can help IFWiki by expanding it.
Genres, How It Begins, Notable Features, full version info.
Note: This page was originally auto-generated. Please check for errors.
Please refer to the IFWiki game page style guide when making changes.