Playing forever: Revision history

22 January 2020

• curprev 11:4611:46, 22 January 2020‎ PiotrGrochowski talk contribs‎ 55,560 bytes −10‎ Undo revision 18275 by Arcorann (talk) no, not the chicken/egg problem again Tag: Undo

10 September 2019

• curprev 06:0306:03, 10 September 2019‎ Simonlc talk contribs‎ 55,570 bytes −15‎ No edit summary

29 July 2019

• curprev 09:0909:09, 29 July 2019‎ Arcorann talk contribs‎ 55,585 bytes +10‎ →‎Loop without Perfect Clear: If you're going to copy info from another wiki, the least you can do is make sure it's not broken. Commented for now

1 July 2019

• curprev 12:1812:18, 1 July 2019‎ PiotrGrochowski talk contribs‎ 55,575 bytes +33,102‎ from http://harddrop.com/w/index.php?title=Playing_forever&action=edit

10 June 2018

• curprev 02:3502:35, 10 June 2018‎ ElectraMiner talk contribs‎ 22,473 bytes +9‎ →‎Open questions
• curprev 02:3402:34, 10 June 2018‎ ElectraMiner talk contribs‎ 22,464 bytes +202‎ →‎5 Bag Solution
• curprev 02:3202:32, 10 June 2018‎ ElectraMiner talk contribs‎ 22,262 bytes −875‎ →‎Open questions
• curprev 02:3102:31, 10 June 2018‎ ElectraMiner talk contribs‎ 23,137 bytes +115‎ →‎External links
• curprev 02:3102:31, 10 June 2018‎ ElectraMiner talk contribs‎ 23,022 bytes +1,781‎ →‎5 Bag Solution
• curprev 02:0602:06, 10 June 2018‎ ElectraMiner talk contribs‎ 21,241 bytes +291‎ →‎Case B: The JILO square in Bag 1 was not successfully completed.
• curprev 02:0302:03, 10 June 2018‎ ElectraMiner talk contribs‎ 20,950 bytes +116‎ →‎Determining the direction of the T
• curprev 02:0202:02, 10 June 2018‎ ElectraMiner talk contribs‎ 20,834 bytes +991‎ →‎Bag 3
• curprev 01:2501:25, 10 June 2018‎ ElectraMiner talk contribs‎ 19,843 bytes +2,863‎ →‎5 Bag Solution
• curprev 00:5100:51, 10 June 2018‎ ElectraMiner talk contribs‎ 16,980 bytes +181‎ No edit summary

4 July 2009

• curprev 03:0003:00, 4 July 2009‎ *>DeHackEd‎ 16,799 bytes −9,725‎ Uses new <playfield> tag, renders MUCH faster.

3 June 2008

• curprev 17:1017:10, 3 June 2008‎ *>DIGITAL‎ 26,524 bytes +6‎ No edit summary

7 February 2008

• curprev 00:4200:42, 7 February 2008‎ *>Lardarse‎ 26,518 bytes −341‎ I'm sorry, but I'm going to have to revert that... See the talk page for details
• curprev 00:4000:40, 7 February 2008‎ 71.193.11.72 talk‎ 26,859 bytes −34‎ →‎Open questions
• curprev 00:2800:28, 7 February 2008‎ 71.193.11.72 talk‎ 26,893 bytes +375‎ →‎Open questions

14 October 2007

• curprev 05:5905:59, 14 October 2007‎ *>Colour thief‎ 26,518 bytes −144‎ Only 3 previews are now required (!!)
• curprev 05:5605:56, 14 October 2007‎ *>Colour thief‎ 26,662 bytes +2,908‎ →‎The L, J, and O piece loop

13 September 2007

• curprev 01:2201:22, 13 September 2007‎ *>Tepples‎ 23,754 bytes −4‎ →‎The Final Bag: correction shows itself after only one bag

30 August 2007

• curprev 01:0401:04, 30 August 2007‎ *>Tepples‎ 23,758 bytes +104‎ →‎Standard procedure: the whole tiling

30 June 2007

• curprev 20:0320:03, 30 June 2007‎ *>Tepples‎ 23,654 bytes +140‎ →‎Open questions: See also Parity
• curprev 02:2502:25, 30 June 2007‎ *>Colour thief‎ 23,514 bytes +300‎ No edit summary

29 June 2007

• curprev 22:1222:12, 29 June 2007‎ *>Colour thief‎ 23,214 bytes +3‎ →‎Open questions
• curprev 21:4821:48, 29 June 2007‎ *>Colour thief‎ 23,211 bytes +732‎ →‎Open questions
• curprev 01:3101:31, 29 June 2007‎ *>Colour thief‎ 22,479 bytes +5,344‎ →‎Balancing the Stacks

27 June 2007

• curprev 01:1601:16, 27 June 2007‎ *>Tepples‎ 17,135 bytes +1,320‎ →‎The I, J piece loop: JIIJ, IJJI

26 June 2007

• curprev 21:5921:59, 26 June 2007‎ *>Tepples‎ 15,815 bytes +199‎ animation of the complete method (140 tetromino loop)
• curprev 21:2521:25, 26 June 2007‎ *>Tepples‎ 15,616 bytes +1,020‎ →‎The S, T, and Z piece loop: There are two ways to play bag 2 of this loop
• curprev 07:3207:32, 26 June 2007‎ *>Lardarse‎ m 14,596 bytes −2‎ →‎The L, O piece loop: typo
• curprev 03:0403:04, 26 June 2007‎ *>Tepples‎ 14,598 bytes −26‎ →‎Open questions: The algorithm is down to 4 previews in the worst case, and Deluxe has 4
• curprev 03:0103:01, 26 June 2007‎ *>Tepples‎ 14,624 bytes +161‎ →‎The L, J, and O piece loop: a reduction to four previews
• curprev 01:5501:55, 26 June 2007‎ *>Tepples‎ 14,463 bytes +9‎ →‎The L, J, and O piece loop: exhibit the worst-case scenario
• curprev 01:5301:53, 26 June 2007‎ *>Tepples‎ 14,454 bytes +9‎ →‎The S, T, and Z piece loop: the top piece of the first 3 patterns doesn't strictly need to come last
• curprev 01:4801:48, 26 June 2007‎ *>Tepples‎ 14,445 bytes +121‎ →‎The I piece loop: caveat about JOL
• curprev 01:3701:37, 26 June 2007‎ *>Tepples‎ 14,324 bytes +511‎ →‎The L, J, and O piece loop: Variation that may prove useful when generalizing to fewer previews
• curprev 01:2801:28, 26 June 2007‎ *>Tepples‎ 13,813 bytes +153‎ →‎Open questions

25 June 2007

• curprev 10:3310:33, 25 June 2007‎ *>Colour thief‎ 13,660 bytes +5,206‎ →‎Balancing the Stacks
• curprev 08:5208:52, 25 June 2007‎ *>Colour thief‎ 8,454 bytes −6‎ →‎Open questions
• curprev 07:1407:14, 25 June 2007‎ *>Colour thief‎ 8,460 bytes 0‎ No edit summary
• curprev 06:5906:59, 25 June 2007‎ *>Colour thief‎ 8,460 bytes 0‎ →‎Balancing the Stacks
• curprev 06:1406:14, 25 June 2007‎ *>Colour thief‎ 8,460 bytes 0‎ →‎The S, T, and Z piece loop
• curprev 04:3004:30, 25 June 2007‎ *>Colour thief‎ 8,460 bytes −6,660‎ major rewrite + more content

24 June 2007

• curprev 15:3615:36, 24 June 2007‎ *>Tepples‎ m 15,120 bytes 0‎ the new animation has more pieces
• curprev 15:1515:15, 24 June 2007‎ *>Tepples‎ 15,120 bytes +245‎ →‎I tetromino: explicitly state how many rows are gained by clearing the singles

23 June 2007

• curprev 23:2223:22, 23 June 2007‎ *>Tepples‎ 14,875 bytes +91‎ If a picture says 1000 words, then how many words does a 320-tetromino animation say?
• curprev 22:4022:40, 23 June 2007‎ *>Tepples‎ 14,784 bytes +180‎ →‎I tetromino: Balancing columns 5 and 6

22 March 2007

• curprev 09:3909:39, 22 March 2007‎ *>DIGITAL‎ 14,604 bytes +30‎ No edit summary