N-Block Tetris Shapes
- From: yaoziyuan@xxxxxxxxx
- Date: 8 Jan 2006 03:01:04 -0800
When I was in elementary school I asked myself: Is there a formula F(n)
for calculating the number of different n-block Tetris shapes? At that
time I manually enumerated F(1) to F(6): 1, 1, 2, 7, 18, 1??. (The
manuscript got lost and I can't recall the exact result for F(6)).
Later I saw a computer program that automatically counted F(n) and
optionally printed every different n-block shape on screen. It was a
moderately optimized complete search algorithm.
Now I want to ask whether there is an existing least time-consuming
algorithm for getting F(n)? Or is it in theory possible to design such
an algorithm?
Regards,
Yao
.
- Prev by Date: P-Time Circuit SAT
- Next by Date: Re: Which programming language to choose : Challenge for real experts here !
- Previous by thread: N-Block Tetris Shapes
- Next by thread: P-Time Circuit SAT
- Index(es):
Relevant Pages
|
