<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: Unscrabbled</title>
	<atom:link href="http://bit-player.org/2008/unscrabbled/feed/" rel="self" type="application/rss+xml" />
	<link>http://bit-player.org/2008/unscrabbled</link>
	<description>An amateur's outlook on computation and mathematics.</description>
	<pubDate>Mon, 01 Dec 2008 20:20:50 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.3</generator>
		<item>
		<title>By: Mark Gritter</title>
		<link>http://bit-player.org/2008/unscrabbled#comment-1723</link>
		<dc:creator>Mark Gritter</dc:creator>
		<pubDate>Wed, 02 Jul 2008 23:08:01 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=152#comment-1723</guid>
		<description>An anonymous commenter on my blog offers this legal path to another one of the 4x4 blocks, so we do have a good bound of 16 tiles.  This requires the use of one of the blank tiles for 'J'.

GJUS

GJUS
*I**
*V**
*Y**

GJUS
*I**
*V**
SYED

GJUS
*I*Y
*V*E
SYED

GJUS
*I*Y
UVAE
SYED

GJUS
JIVY
UVAE
SYED</description>
		<content:encoded><![CDATA[<p>An anonymous commenter on my blog offers this legal path to another one of the 4&#215;4 blocks, so we do have a good bound of 16 tiles.  This requires the use of one of the blank tiles for &#8216;J&#8217;.</p>
<p>GJUS</p>
<p>GJUS<br />
*I**<br />
*V**<br />
*Y**</p>
<p>GJUS<br />
*I**<br />
*V**<br />
SYED</p>
<p>GJUS<br />
*I*Y<br />
*V*E<br />
SYED</p>
<p>GJUS<br />
*I*Y<br />
UVAE<br />
SYED</p>
<p>GJUS<br />
JIVY<br />
UVAE<br />
SYED</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Barry Cipra</title>
		<link>http://bit-player.org/2008/unscrabbled#comment-1722</link>
		<dc:creator>Barry Cipra</dc:creator>
		<pubDate>Wed, 02 Jul 2008 21:43:10 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=152#comment-1722</guid>
		<description>I'll try that again, in case it's so obscure even Brian can't figure out what I meant:

*HEY
****
****
****


*HEY
**Y*
**R*
**Y*


*HEY
HIYA
**R*
**Y*


THEY
HIYA
E*R*
Y*Y*


THEY
HIYA
E*R*
YAYS


THEY
HIYA
EYRY
YAYS

(I was trying to use -'s for empty squares and run all the steps across one "line" in the first attempt, but the wordprocessing here seems to ignore repeated space bar entries, and interprets multiple -'s in some weird way.)</description>
		<content:encoded><![CDATA[<p>I&#8217;ll try that again, in case it&#8217;s so obscure even Brian can&#8217;t figure out what I meant:</p>
<p>*HEY<br />
****<br />
****<br />
****</p>
<p>*HEY<br />
**Y*<br />
**R*<br />
**Y*</p>
<p>*HEY<br />
HIYA<br />
**R*<br />
**Y*</p>
<p>THEY<br />
HIYA<br />
E*R*<br />
Y*Y*</p>
<p>THEY<br />
HIYA<br />
E*R*<br />
YAYS</p>
<p>THEY<br />
HIYA<br />
EYRY<br />
YAYS</p>
<p>(I was trying to use -&#8217;s for empty squares and run all the steps across one &#8220;line&#8221; in the first attempt, but the wordprocessing here seems to ignore repeated space bar entries, and interprets multiple -&#8217;s in some weird way.)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Barry Cipra</title>
		<link>http://bit-player.org/2008/unscrabbled#comment-1721</link>
		<dc:creator>Barry Cipra</dc:creator>
		<pubDate>Wed, 02 Jul 2008 21:29:30 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=152#comment-1721</guid>
		<description>Mark Gritter writes "I think the middle one is actually reachable via legal play."  Here's one way to do it, making use of the SOWPODS intermediates HEY, HI, and YA:
&lt;pre&gt;
-HEY        -HEY       -HEY       THEY        THEY       THEY
----        --Y-       HIYA       HIYA        HIYA       HIYA
----        --R-       --R-       E-R-        E-R-       EYRY
----        --Y-       --Y-       Y-Y-        YAYS       YAYS
&lt;/pre&gt;
My apologies if the columns don't line up well (I hope Brian will fix it so they do).</description>
		<content:encoded><![CDATA[<p>Mark Gritter writes &#8220;I think the middle one is actually reachable via legal play.&#8221;  Here&#8217;s one way to do it, making use of the SOWPODS intermediates HEY, HI, and YA:</p>
<pre>
-HEY        -HEY       -HEY       THEY        THEY       THEY
----        --Y-       HIYA       HIYA        HIYA       HIYA
----        --R-       --R-       E-R-        E-R-       EYRY
----        --Y-       --Y-       Y-Y-        YAYS       YAYS
</pre>
<p>My apologies if the columns don&#8217;t line up well (I hope Brian will fix it so they do).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Craig Kaplan</title>
		<link>http://bit-player.org/2008/unscrabbled#comment-1719</link>
		<dc:creator>Craig Kaplan</dc:creator>
		<pubDate>Wed, 02 Jul 2008 21:14:00 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=152#comment-1719</guid>
		<description>Another note -- the rules don't say anything explicit about what to do when continued play is impossible.  But players always have the option of passing.  I found &lt;a href="http://www.farscapegames.co.uk/shopscr743.html" rel="nofollow"&gt;one site&lt;/a&gt; that says that the game ends if everyone passes twice in a row.  Hasbro (and my physical Scrabble game) &lt;a href="http://www.hasbro.com/games/adult-games/scrabble/home.cfm?page=About/gameplay" rel="nofollow"&gt;says&lt;/a&gt; "The game ends when all letters have been drawn and one player uses his or her last letter; or when all possible plays have been made," which could be taken to include stymied positions.</description>
		<content:encoded><![CDATA[<p>Another note &#8212; the rules don&#8217;t say anything explicit about what to do when continued play is impossible.  But players always have the option of passing.  I found <a href="http://www.farscapegames.co.uk/shopscr743.html" rel="nofollow">one site</a> that says that the game ends if everyone passes twice in a row.  Hasbro (and my physical Scrabble game) <a href="http://www.hasbro.com/games/adult-games/scrabble/home.cfm?page=About/gameplay" rel="nofollow">says</a> &#8220;The game ends when all letters have been drawn and one player uses his or her last letter; or when all possible plays have been made,&#8221; which could be taken to include stymied positions.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Craig Kaplan</title>
		<link>http://bit-player.org/2008/unscrabbled#comment-1718</link>
		<dc:creator>Craig Kaplan</dc:creator>
		<pubDate>Wed, 02 Jul 2008 20:01:45 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=152#comment-1718</guid>
		<description>Come to think of it, it might be easier to generate a stymied position at the &lt;em&gt;end&lt;/em&gt; of a game rather than the beginning.  Let's just imagine playing out 98 tiles, leaving each player with a single V and nowhere to place it.  I expect it would be pretty easy to construct such a board, though I'd be the first to admit that it's much more boring as a stymied position than a minimal grid on an otherwise empty board.</description>
		<content:encoded><![CDATA[<p>Come to think of it, it might be easier to generate a stymied position at the <em>end</em> of a game rather than the beginning.  Let&#8217;s just imagine playing out 98 tiles, leaving each player with a single V and nowhere to place it.  I expect it would be pretty easy to construct such a board, though I&#8217;d be the first to admit that it&#8217;s much more boring as a stymied position than a minimal grid on an otherwise empty board.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Craig Kaplan</title>
		<link>http://bit-player.org/2008/unscrabbled#comment-1717</link>
		<dc:creator>Craig Kaplan</dc:creator>
		<pubDate>Wed, 02 Jul 2008 19:56:02 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=152#comment-1717</guid>
		<description>Mark, yes, I found the same three 4x4 grids and came to the same conclusions.  Alas, I don't think any of them can arise in legal play.  I'll hunt for simple move sequences that generate stymied 5x5 grids.

Your comment about words that cannot be extended because the necessary letters have already been used is very interesting.  It makes the search significantly more complex, even for 4x4 grids, since in theory any word could be involved.  It's unlikely, but it might even produce a stymied 3x3 grid!</description>
		<content:encoded><![CDATA[<p>Mark, yes, I found the same three 4&#215;4 grids and came to the same conclusions.  Alas, I don&#8217;t think any of them can arise in legal play.  I&#8217;ll hunt for simple move sequences that generate stymied 5&#215;5 grids.</p>
<p>Your comment about words that cannot be extended because the necessary letters have already been used is very interesting.  It makes the search significantly more complex, even for 4&#215;4 grids, since in theory any word could be involved.  It&#8217;s unlikely, but it might even produce a stymied 3&#215;3 grid!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: brian</title>
		<link>http://bit-player.org/2008/unscrabbled#comment-1715</link>
		<dc:creator>brian</dc:creator>
		<pubDate>Wed, 02 Jul 2008 13:03:09 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=152#comment-1715</guid>
		<description>Thanks, Mark! Very impressive.</description>
		<content:encoded><![CDATA[<p>Thanks, Mark! Very impressive.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Gritter</title>
		<link>http://bit-player.org/2008/unscrabbled#comment-1714</link>
		<dc:creator>Mark Gritter</dc:creator>
		<pubDate>Wed, 02 Jul 2008 06:35:56 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=152#comment-1714</guid>
		<description>This approach doesn't take letter frequencies into account.  There might be a position which has words that can be extended, but only via letters already used up.  (But for small positions the blank would probably allow play.)

Here are the 4x4 blocks that are not extensible.  Note that they are all symmetric.

GJUS
JIVY
UVAE
SYED

THEY
HIYA
EYRY
YAYS

TECS
ELHI
CHEZ
SIZY

I think the middle one is actually reachable via legal play, excepct that it has 6 occurences of 'Y'. The other two look hopeless as well.</description>
		<content:encoded><![CDATA[<p>This approach doesn&#8217;t take letter frequencies into account.  There might be a position which has words that can be extended, but only via letters already used up.  (But for small positions the blank would probably allow play.)</p>
<p>Here are the 4&#215;4 blocks that are not extensible.  Note that they are all symmetric.</p>
<p>GJUS<br />
JIVY<br />
UVAE<br />
SYED</p>
<p>THEY<br />
HIYA<br />
EYRY<br />
YAYS</p>
<p>TECS<br />
ELHI<br />
CHEZ<br />
SIZY</p>
<p>I think the middle one is actually reachable via legal play, excepct that it has 6 occurences of &#8216;Y&#8217;. The other two look hopeless as well.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Gritter</title>
		<link>http://bit-player.org/2008/unscrabbled#comment-1713</link>
		<dc:creator>Mark Gritter</dc:creator>
		<pubDate>Wed, 02 Jul 2008 06:08:31 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=152#comment-1713</guid>
		<description>That figure should be 

oxxo
xxxx
xxxx
oxxo</description>
		<content:encoded><![CDATA[<p>That figure should be </p>
<p>oxxo<br />
xxxx<br />
xxxx<br />
oxxo</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Gritter</title>
		<link>http://bit-player.org/2008/unscrabbled#comment-1712</link>
		<dc:creator>Mark Gritter</dc:creator>
		<pubDate>Wed, 02 Jul 2008 06:08:03 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=152#comment-1712</guid>
		<description>No 3x3 block can be a terminal position.

I took the SOWPODS list and ran it through a perl script looking for words which cannot be extended to longer legal words.  The only way to get a 3x3 block which cannot be played upon is if none of the 9 words can be extended to 4 or more letters.

Alas, there are only 5 words of length 3 that are not stems:
SWY
FAP
TWP
VLY
QIS

Obviously these cannot be assembled into a 3x3 block.  (There are no nonextendable words of length two.)

Any 4x3 block would have to contain four of these words along the short dimension (not necessarily unique) which doesn't look possible.

There are 250 such words of length 4, leading to a search space of about 4 billion possibilities.  Might be feasible.

Could something smaller than a 4x4 block be terminal?  Perhaps something like this


 xx
xxxx
xxxx
 xx


would work if the 2-letter runs did not have a common letter in their extensions.</description>
		<content:encoded><![CDATA[<p>No 3&#215;3 block can be a terminal position.</p>
<p>I took the SOWPODS list and ran it through a perl script looking for words which cannot be extended to longer legal words.  The only way to get a 3&#215;3 block which cannot be played upon is if none of the 9 words can be extended to 4 or more letters.</p>
<p>Alas, there are only 5 words of length 3 that are not stems:<br />
SWY<br />
FAP<br />
TWP<br />
VLY<br />
QIS</p>
<p>Obviously these cannot be assembled into a 3&#215;3 block.  (There are no nonextendable words of length two.)</p>
<p>Any 4&#215;3 block would have to contain four of these words along the short dimension (not necessarily unique) which doesn&#8217;t look possible.</p>
<p>There are 250 such words of length 4, leading to a search space of about 4 billion possibilities.  Might be feasible.</p>
<p>Could something smaller than a 4&#215;4 block be terminal?  Perhaps something like this</p>
<p> xx<br />
xxxx<br />
xxxx<br />
 xx</p>
<p>would work if the 2-letter runs did not have a common letter in their extensions.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
