@x an experimental change file for SSXCC-BINARY (the new version of 25 Aug!)
those heuristics were designed with binary branching in mind.
@y
those heuristics were designed with binary branching in mind.
The heuristic implemented in this version is motivated by the paper
of Boussemart, Hemery, Lecoutre, and Sais in {\sl Proc.\ 16th
European Conference on Artificial Intelligence} (2004), 146--150: We increase
the weight of a primary item when its current set of options becomes null.
Items are chosen for branching based on the size of their set divided by their
current weight, unless the choice is forced.
@^Boussemart, Fr\'ed\'eric@>
@^H\'emery, Fred@>
@^Lecoutre, Christophe@>
@^Sa{\"\i}s, Lakhdar@>
@z
@x
 if (!include_option(cur_choice)) goto tryagain;
 @<increase &#124;stage&#124;@>;@+@<increase &#124;level&#124;@>;
 goto forward;
@y
 if (!include_option(cur_choice)) goto abort;
 @<increase &#124;stage&#124;@>;@+@<increase &#124;level&#124;@>;
 goto forward;
abort:@+@<increase the weight of &#124;tough_itm&#124;@>;
@z
@x
@d inf_size 0x7fffffff
@<set &#124;best_itm&#124; to the best item for branching...@>=
{
 t=inf_size,tmems=mems;
@y
@d inf_size 0x7fffffff
@d infty 2e32f /* twice &#124;dangerous&#124; */
@<set &#124;best_itm&#124; to the best item for branching...@>=
{
 register float score,tscore,w;
 t=inf_size,tmems=mems,score=infty;
@z
@x
 for (k=0;k<active;k++) if (o,item[k]<second) { o,s=size(item[k]); if ((vbose&show_details) && level<show_choices_max && level>=maxl-show_choices_gap) {
 print_item_name(item[k],stderr);
 fprintf(stderr,"("O"d)",s);
 }
 if (s<=1) { if (s==0) fprintf(stderr,"I'm confused.\n"); /* &#124;include_option&#124; missed this */ else o,force[forced++]=item[k]; }@+else if (s<=t) { if (s<t) best_itm=item[k],t=s; else if (item[k]<best_itm) best_itm=item[k]; /* suggested by P. Weigel */ } } @y for (k=0;k<active;k++) if (o,item[k]<second) { o,s=size(item[k]); if (s<=1) { if (s==0) fprintf(stderr,"I'm confused.\n"); /* &#124;include_option&#124; missed this */ else o,force[forced++]=item[k]; }@+else { o,w=wt(item[k]); tscore=s/w; if (tscore>=infty) tscore=dangerous;
 if (tscore<=score) { if (tscore<score) best_itm=item[k],score=tscore,t=s; else if (item[k]<best_itm) best_itm=item[k]; } } if ((vbose&show_details) && level<show_choices_max && level>=maxl-show_choices_gap) {
 print_item_name(item[k],stderr);@+
 if (s==1) fprintf(stderr,"(1)");
 else fprintf(stderr,"("O"d,"O"g)",s,w);
 }
 }
@z
@x
 fprintf(stderr,"("O"d)\n",t);
@y
 fprintf(stderr,"("O"d), score "O".4f\n",t,score);
@z
</div><div class="naked_ctrl">
<form action="/index.cgi/speech" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://cs.stanford.edu/~knuth/programs/ssxcc-wtd.ch">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://cs.stanford.edu/~knuth/programs/ssxcc-wtd.ch" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech" selected="selected">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>