lean-ja / lean-ja/lean-by-example
ナップサック問題
Open
Nobody has claimed this yet.
付録アイデア
- Dominant language
- Lean
- Stars
- 188
- Forks
- 15
- Avg merge
- 9h 8m
- Merged PRs (30d)
- 6
Description
- ナップサック問題を定義する
- 全探索を実装する
- 全探索の実装のためには、「与えられたアイテムの部分集合全体」を列挙できる必要がある。
Vector Bool nを全列挙して、それをアイテムの部分集合だと見做すのが良いのではないか？ - 全探索が正しく最適解を返すことを証明する。これには、全列挙が正しく全列挙であることの証明が含まれるだろう。
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue does not name a file or test; start by locating the repository’s existing Lean code examples and conventions for finite enumeration and proofs. Define the knapsack problem, implement exhaustive enumeration using Vector Bool n as described, and establish both that enumeration is complete and that the returned solution is optimal.
Written by the indexing model from the issue text.
Assessment
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Quiet
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100