HDTenEightyP/NetNews huggingface dataset:
Newsgroups: rec.puzzles
Subject: Re: Billion-year survivability
From: jhsegal@wiscon.weizmann.ac.il (Livian)
Date: Thu, 12 Nov 1992 19:42:13 GMT
Organization: Weizmann Institute of Science, Computation Center

In article <10920011@pollux.svale.hp.com> ryoung@pollux.svale.hp.com (Roderick Young) writes:
>If I wanted to send information to a society that will inhabit the earth
>one billion years in the future, how would I do it?  If I engraved the
>message on a bunch of diamonds, then buried the diamonds in a secure place,
>would that do it?  There must be a better way.

  I don't think the diamonds idea is so good,because if an atomic bomb will fall
in the close are,say bye-bye to your message.
  The crazy thing I thought about,is to send a very very very powerful signal
in space in such a(calculated) way that the echo reflected by some astroligical
body will arrive back to the earth in 1 bilion years.

  Carzy,but...who knows..

                                   ___
                                  (o o)
 ------------------------------ooO-(_)-Ooo------------------------------------
  __     __  __    ___ __     _     ___   __
    |      |   \     /   |     \       \    | VM/CMS:
    |      |    \   /    |    _ \       \   | JHSEGALL @ Weizmann.weizmann.ac.il
    |___   |       /     |    _  \    |  \  | UNIX:
        |  |      /      |   /    \   |     |  JHSEGAL  @ Wiscon.weizmann.ac.il
Newsgroups: rec.puzzles
From: latarra@camelot.bradley.edu (Lisa Ehren)
Subject: Re: the question is the answer ?!
Organization: Bradley University
Date: 10 Nov 92 04:43:09 GMT

My english prof came up with this one, unintentionally:

Which is the nonrestrictive clause beginning?

<as opposed to that...:)>
From: dodson@convex.COM (Dave Dodson)
Newsgroups: rec.puzzles
Subject: Re: SOLVE EQUATIONS
Date: 13 Nov 92 16:40:40 GMT
Article-I.D.: news.1992Nov13.164040.15203
Reply-To: dodson@convex.COM (Dave Dodson)
Organization: Engineering, CONVEX Computer Corp., Richardson, Tx., USA
Originator: dodson@bach.convex.com
X-Disclaimer: This message was written by a user at CONVEX Computer
              Corp. The opinions expressed are those of the user and
              not necessarily those of CONVEX.

In article <10920012@pollux.svale.hp.com> ryoung@pollux.svale.hp.com (Roderick Young) writes:
>Take reciprocal of both sides,
>1/y  = x + (big thing on right)
>     = x + y
>
>Multiply through by y
>
>1    = xy + yy
>
>or
>
>y^2 +xy - 1 = 0.  For any given x, we can solve the equation and get 2 roots.
>(interesting... an alegraic expression that evaluates to two different
> things.  doesn't seem intuitive!)

You can't claim the expression evaluates to two different things.
What you have shown is that the iteration

	y_{n+1} := 1 / ( x + y_n )

has two fixed points, i.e., two points at which y_{n+1} = y_n.

To decide if a fixed point is convergent or not, check |f'(y)|; if it is < 1,
the fixed point is convergent but if it is > 1, the fixed point is divergent.
If a fixed point is divergent, the sequence won't settle to that value.  In
this case, only one of the fixed points has |f'(y)| < 1, the one with the
positive solution of the quadratic.  At the negative solution, |f'(y)| > 1.

----------------------------------------------------------------------

Dave Dodson		                             dodson@convex.COM
Convex Computer Corporation      Richardson, Texas      (214) 497-4234
From: jbarnett@nrtc.northrop.com (Jeff Barnett)
Newsgroups: rec.puzzles
Subject: Re: Does anybody know what a TRYPTYCH is?
Date: 10 Nov 92 17:25:41 GMT
Reply-To: jbarnett@nrtc.northrop.com (Jeff Barnett)

In article <3196@nlsun1.oracle.nl>, asymes@nl.oracle.com (Andy Symes) writes:
|> Folks,
|> 
|> The other day I was reading a Roman Catholic directory, and one of the
|> small ads had for sale 'tryptychs', among other things. Can anybody
|> enlighten me on the meaning of this word? Presumably it is a piece of
|> Church hardware, and I would like to add it to my list of unusual
|> words (the word, that is, not the item :).
|> 
A tryptychs(sp?) is a sequence of folding pannels -- something like a Japanese
bedroom screen.  It can be of various sizes including, and usually, smaller.
If memory serves me correctly, there are typically three pannels, hence, the
name.  The interesting thing is that tryptychs are usually used to paint on,
i.e., they are the "canvas".  In particular, much of the artistic work of
Bosch was done on these screens.  Bosch painted the visions of a madman
intertwined with religious images.  (I think of him as the cartoonist from
hell.)  I think a lot of the older church art was done on these screens.

Jeff Barnett
From: asymes@nl.oracle.com (Andy Symes)
Newsgroups: rec.puzzles
Subject: Does anybody know what a TRYPTYCH is?
Date: 5 Nov 92 17:14:48 GMT
Followup-To: rec.puzzles
Organization: Oracle Europe
X-Disclaimer: This message was written by an unauthenticated user
              at Oracle Corporation.  The opinions expressed are those
              of the user and not necessarily those of Oracle.

Folks,

The other day I was reading a Roman Catholic directory, and one of the
small ads had for sale 'tryptychs', among other things. Can anybody
enlighten me on the meaning of this word? Presumably it is a piece of
Church hardware, and I would like to add it to my list of unusual
words (the word, that is, not the item :).

Two others I like, in the same obvious category:

      syzygy     -     some sort of astronomical conjunction?
      symphysy   -     ???

Have fun,

Andy.
---
Disclaimer:  These are my opinions and mine alone, and don't reflect the
             views or position of my employer.
Newsgroups: rec.puzzles,rec.org.mensa
From: stein@hal.nta.no (Stein Kulseth FBA)
Subject: Re: the question is the answer ?!
Organization: Norwegian Telecom Research
Date: Tue, 10 Nov 92 15:43:38 GMT

In article <1992Nov10.144701.390@blaze.cs.jhu.edu>, wilson@rhombus.cs.jhu.edu (Dwight Wilson) writes:
|> In article <1992Nov5.213159.10826@sbcs.sunysb.edu> kthiruma@engws3.ic.sunysb.edu () writes:
|> >
|> >a question when repeated becomes its own answer.
|> >
|> 
|> This reminds me of a (probably apocryphal) story I read somewhere
|> long ago.  It seems a professor gave a final exam consisting of
|> a single question.
|> 
|> "Write a question that you feel would be suitable for a 
|> final exam and answer it."
|> 
|> One student thought for a few moments, then wrote the above
|> sentence twice.
|> 
|> -Dwight

Well, I hope he flunked, for he obviously did not answer the question.

-- 
stein.kulseth@nta.no (Norwegian Telecom Research)
   'When murders are committed by mathematics, they can be solved by
   mathematics. Most of them aren't, and this one wasn't'
   - Nick Charles (Dashiell Hammett's "The Thin Man")
Newsgroups: rec.puzzles
From: asimov@wk223.nas.nasa.gov (Daniel A. Asimov)
Subject: Decompose a sphere into (pointwise) congruent pieces 
Organization: NASA Ames Research Center
Date: Fri, 13 Nov 92 01:26:13 GMT

For which n can the surface of a sphere be decomposed into n
congruent pieces, down to the last point?

For the purpose of this question, we will be precise about what
"decompose" means.  In this case, *every* point of the sphere must
be assigned to one and only one of the n pieces.

Also, to avoid weird topology, let us assume that the only kind
of pieces to consider in this question are spherical polygons
(that is, bounded by great circle ars) which contain all their
interior points and a specified subset of their boundary.

Finally, for this question, let two pieces be "congruent" if there
is any 1-1 and onto mapping between them which preserves distance
(it is allowed to reverse orientation).

For an example, it is easy to see that n = 2 works.  For, let one
piece consist of the northern hemisphere, together with a semicircle
of the equator which includes just one of its endpoints. The other
piece is what remains.  The antipodal mapping shows the two pieces
are congruent.

--Daz




Newsgroups: rec.puzzles
From: hoens@gmd.de (Guenter Hoens)
Subject: Re: the question is the answer ?!
Organization: GMD, Sankt Augustin, Germany
Date: Tue, 10 Nov 1992 08:55:15 GMT

In <latarra.721370589@camelot> latarra@camelot.bradley.edu (Lisa Ehren) writes:

>My english prof came up with this one, unintentionally:

>Which is the nonrestrictive clause beginning?

what is the most used question word?

--
-----------------------------------------------------------------
* Guenter Hoens, GMD - I8, 
* German National Research Center for Computer Science
* hoens@gmd.de    (02241) 14-2408
Newsgroups: rec.puzzles
From: jeffe@cory.Berkeley.EDU (Jeff Erickson)
Subject: Re: Billion-year survivability
Keywords: pi, Louie
Organization: University of California, Berkeley
Date: Tue, 10 Nov 1992 19:56:14 GMT

ryoung@pollux.svale.hp.com (Roderick Young) writes:
>If I wanted to send information to a society that will inhabit the earth
>one billion years in the future, how would I do it?  If I engraved the
>message on a bunch of diamonds, then buried the diamonds in a secure place,
>would that do it?  There must be a better way.

Sure.  Just make sure that the information you're sending is some
important mathematical constant, like pi or e.  If there's anyone
around in a billion years, your "message" will still be around.

Obviously, that's not very useful.  Suppose you wanted to send a
recording of "Louie, Louie" instead.  If you came up with some sort of
decoding algorithm that would take the first billion bits of pi as
input and produced "Louie, Louie" as output, then all you'd need to
send is the decoder.  Provided that the decoder is shorter than
"Louie, Louie", you've got less information to send, and so it should
be easier to send it.

Another possibility is to start a REALLY GOOD religion, and pass the
information (or just the decoder) to your followers as Holy Writ:

Priest:   "Looway looway."
Response: "Woah whoa."
Priest:   "Seh weeg otta gohnau."
Response: "Yeah yeah yeah yeah yeah."

:-)

Newsgroups: rec.puzzles
From: amorgan@Xenon.Stanford.EDU (Crunchy Frog)
Subject: Re: Formulae for pi
Organization: Computer Science Department, Stanford University.
Date: Tue, 10 Nov 1992 05:34:08 GMT

>In article <1992Nov6.163504.17171@husc15.harvard.edu>, blom@husc15.harvard.edu writes:
>|>  
>|>   x_n+1 := ((x_n)^(1/2) + (x_n)^(-1/2)) / 2              x_0 := 2^(1/2)
>|>                                                         
>|>   y_n+1 := (y_n(x_n)^(1/2) + (x_n)^(-1/2)) / (y_n + 1)   y_0 := 2^(1/4)
>|> 
>|>   pi_n := pi_n-1 (x_n + 1) / (y_n + 1)                  pi_0 := 2 + 2^(1/2)

Just to ask the stupid question of the week: This does require that
you can calculate root 2 to any required precision, right?  If, say, I
can only get 100 digits of root 2 accurately how far can I trust the
digits of pi that I generate?

C Frog 
Newsgroups: rec.puzzles
From: crosby@ucsu.Colorado.EDU (CROSBY MATTHEW JAMES)
Subject: Re: Nucleotids
Organization: University of Colorado, Boulder
Date: Sun, 8 Nov 1992 03:28:53 GMT

In article <1992Oct30.055902.6491@galois.mit.edu> jbaez@riesz.mit.edu (John C. Baez) writes:
>In article <2af030e2wnr070@ark.abg.sub.org> ralf@ark.abg.sub.org (Ralf Stephan) writes:
>>Are there meaningful English words that can be built with the nucleotid
>>letters C, A, G, T  besides cat, tag and gag, esp. with more than 3 letters?
>
>tat, tata, gaga, and caca (if obscene baby-talk counts), GATT (if
>acronyms are).  
You are showing a decided lack of tact!



-- 
-Matt
Mere anarchy is loosed upon the net!!!!
mcrosby@nyx.cs.du.edu     or     crosby@cs.colorado.edu
Newsgroups: rec.puzzles,rec.org.mensa
From: dwr2560@zeus.tamu.edu (RING, DAVID WAYNE)
Subject: Re: the question is the answer ?!
News-Software: VAX/VMS VNEWS 1.41    
Organization: Texas A&M University, Academic Computing Services
Date: Sat, 7 Nov 1992 00:54:00 GMT

>> a question when repeated becomes its own answer.

"What is a question which is it's own answer?"

:)

Dave Ring
dwr2560@zeus.tamu.edu
From: colin@cs.uq.oz.au (Colin Millerchip)
Newsgroups: rec.puzzles
Subject: Re: Does anybody know what a TRYPTYCH is?
Date: 10 Nov 92 05:57:33 GMT
Reply-To: colin@cs.uq.oz.au

In <3196@nlsun1.oracle.nl> asymes@nl.oracle.com (Andy Symes) writes:

>The other day I was reading a Roman Catholic directory, and one of the
>small ads had for sale 'tryptychs', among other things. Can anybody
>enlighten me on the meaning of this word? Presumably it is a piece of
>Church hardware, and I would like to add it to my list of unusual
>words (the word, that is, not the item :).

In St. Bavo's cathedral in Gent, Belgium, I believe there is a very
famous tryptych called "The Adoration of the Lamb". It might be of
interest to readers of this group (though more for sci.math I would
guess), since apparently there are some unusual geometric properties in
the faces of Jesus and Mary.  

I only stood and gaped at it, but no doubt someone out there can
enlighten us as these properties ("Not the golden ratio *again*!"...
no, I think we are safe from this).  

C.


--
|Colin Millerchip           | "And all this science I don't understand,|
|University of Queensland,  |  It's just my job five days a week"      |
|Brisbane, Australia.       |   - "Rocketman", Elton John              |
|colin@cs.uq.oz.au          |                                          |
From: Barry.John.Good@brunel.ac.uk (Barry John Good)
Newsgroups: rec.puzzles
Subject: Re: Word sequence
Date: 11 Nov 92 14:22:51 GMT
Organization: Brunel University, West London, UK


I thought some smart Aleck might do that.
Okay, please modify the problem to disallow repetition of a word .
The longest sequence I've received so far is:
TSAR SARI ARID RIDE IDEA DEAR EARS ARSE
Newsgroups: rec.puzzles
From: tolman%asylum.cs.utah.edu@cs.utah.edu (Kenneth Tolman)
Subject: Re: Billion-year survivability
Date: 10 Nov 92 13:46:32 MST
Organization: University of Utah, CompSci Dept

>If I wanted to send information to a society that will inhabit the earth
>one billion years in the future, how would I do it?  If I engraved the
>message on a bunch of diamonds, then buried the diamonds in a secure place,
>would that do it?  There must be a better way.

Interesting question.  Your method may not even work... someone would dig
it up and say "diamond" and put it on their neck and never look at it
closely... or may even say interesting pattern, but never figure out that
it is in a language.  What assumptions do we have to go on?

1) Do they speak english or any other common tongue?  If not, the message
would HAVE to be very long for them to even hope of deciphering a meaning,
and pictures would be better.  What spectrum do they see in? 

2) How will they recognize the artifact as bearing a message?  If it is
extremely tiny, like microengraving on a diamond no one will see it.
If it is large, then it will likely be destroyed...

3) How big a message do we want to transmit?  Presumably, we would want to
encode as much information as conceivable, so we would have a huge 
library of info.  Thus we would probably have a bunch of simple starting
things to get across concepts (pictures and diagrams) along with the
symbols that represent them, and then go into full symbols...


Another possible route would be to launch a bunch of satellites with extremely
long periods of revolution (about the sun) so they are like Halleys comet...
or else merely writing an extremely popular book which
contains the message, so that the libraries of the future will contain it
in the past... make some comments about how it is to be read in a billion
years so someone glances at it

It seems impossible to guarantee that it will be recieved, in any event.
From: peake@vax.oxford.ac.uk
Newsgroups: rec.puzzles
Subject: Re: Formula for Pi
Date: 9 Nov 92 16:23:57 GMT
Organization: Oxford University VAX 6620

> Could someone please provide me with a formula I can use to write a 
> simple BASIC program to calculate Pi to any number of digits. 

One formula which you might use, after complicated programming, is

Pi = 16*arctan(5)-4*arctan(1/239)
                     
and then use arctan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...

Michael Peake.
Newsgroups: rec.games.chess
From: hyde@cs.dal.ca (Bill Hyde)
Subject: Re: Fischer-Polgar Match
Organization: Math, Stats & CS, Dalhousie University, Halifax, NS, Canada
Date: Fri, 6 Nov 1992 15:17:35 GMT

In article <17162@mindlink.bc.ca>, Peter_Stockhausen@mindlink.bc.ca (Peter Stockhausen) writes:
|> > Paul Epstein writes:
|> >
|> > Msg-ID: <1992Nov3.213819.29847@math.utexas.edu>
|> > Posted: Tue, 3 Nov 1992 21:38:19
|> >
|> > Org.  : University of Texas at Austin Mathematics
|> >
|> > wchen@beirut.berkeley.edu (William Chen) writes:
|> >
|> > >My prediction?  Judit wins 12-0.  Fischer IS going to give knight odds,
|> > >isn't he?  <smileys where appropriate>
|> >
|> > >Bill
|> >
|> > Fischer apparently once said that he could give any woman knight odds and
|> > still win.
|> >
|> >
|> 
|> He did say this, but almost 20 years ago. Nobody took him up on it
|> so I guess that he was right, at the time.


	On the contrary, the Soviets did take him up on it.
	Fischer did not reply to their offer. At least according
	to Harold Schonberg.


						Bill Hyde
Department of Oceanography
Dalhousie University,
Halifax, Nova Scotia
hyde@Ice.ATM.Dal.Ca or hyde@dalac

Newsgroups: rec.games.chess
From: sloan@cis.uab.edu (Kenneth Sloan)
Subject: Re: provisional ICS ratings 
Organization: CIS, University of Alabama at Birmingham
Date: Fri, 6 Nov 1992 18:20:23 GMT

In article <1992Nov6.123624.4401@email.tuwien.ac.at> herbert@mips.complang.tuwien.ac.at (Herbert Pohlai) writes:
>...
>If the provisional rating for a new player is low,
>no one will take the risk of playing against this low rated, but
>possibly strong opponent.
>
>If the provisional rating is high, everybody will be ready
>to play against new opponents - and this is what a new
>player wants !!! 
>
>From this point of view, it would be a nice idea to set the
>provisional rating somewhere in the 1500 - 2000 range.

Gag!  ACK! Arrggh!

This is a classic example of how *not* to administer a rating system.
Ratings should be used to rate players - *not* to manipulate the players
to meet some lofty goal of the administrators.  Once you start
introducing twiddles into the ratings system so that "good things will
happen", the rating system loses all credibility.

-Ken Sloan
-- 
Kenneth Sloan                   Computer and Information Sciences
sloan@cis.uab.edu               University of Alabama at Birmingham
(205) 934-2213                  115A Campbell Hall, UAB Station 
(205) 934-5473 FAX              Birmingham, AL 35294-1170
From: amirishs@acf9.nyu.edu (shaahin amiri sharifi)
Newsgroups: rec.games.chess
Subject: help
Summary: help
Date: 10 Nov 92 17:49:45 GMT
Organization: New York University

Hi!
Sometimes ago, somebody'd posted an article about Swimpsky(?!)
and rules of chess. Can somebody please post it again or send
it to me.
Newsgroups: rec.games.chess
From: juffi@ai.univie.ac.at (Johannes Fuernkranz)
Subject: Fischer - Karpov
Organization: Dept. Med.Cybernetics & Artif.Intelligence, Univ.Vienna, Austria, Europe
Date: Wed, 11 Nov 1992 10:42:43 GMT

The German Schach Magazin 64 reports rumours about a possible Fischer - Karpov match
in its last issue (21/92).
According to this article there is an offer of 10 Million Dollars for Fischer - Karpov.
The delicate thing about this is that no dubious Yugoslavian money is involved: The
offer is from a sponsor in Atlantic City. Kasparov must be pretty mad at this, because
the 1993 World Championship busted, because the main sponsor didn't want to come up
with the 3 Million, and now Fischer can get 10! So much about the publicity of
Fischer - Karpov versus Kasparov - anybody ;-).
Karpov is said to have agreed, but other serious problems will probably make this
match impossible:
1) Fischer is Fischer is Fischer is ...
2) Of course Bobby can't play in the U.S. (maybe they'll play in Alcatraz?)
   n if he can get in without troubles despite his playing in Yugoslavia,
   he still won't pay his taxes and they even got Al Capone for this (That's
   what the article said, don't flame me!)

						Juffi



-- 
Johannes Fuernkranz                                    +43-1-5336112(Tel)
Austrian Research Inst. for Artificial Intelligence    +43-1-5320652(Fax)
Schottengasse 3, A-1010 Vienna, Austria, Europe     juffi@ai.univie.ac.at 
--------------- "Life is too short for Chess." -- Byron -----------------
From: traveja@wkuvx1.bitnet (Mathmagician/Fizix Geek)
Newsgroups: rec.games.chess
Subject: English Hedgehog? Please explain.
Date: 13 Nov 92 14:31:55 GMT
Article-I.D.: wkuvx1.1992Nov13.083155.3927
Organization: Western Kentucky University, Bowling Green, KY

Fellow chessplayers,

	Would someone be kind enough to give the basic moves
for the Hedgehog variation of the English. I have BCO2, but
it appears that I can not discern exactly which variation of
the English this is. I have assumed it arises from the 
"symmetrical variation" :

	1.	c4	c5
	2.	Nc3	Nc6
etc.
Is this true?

I have a copy of the FAQ, but could not find this info there.

Thanks X 10^6, in advance.
Yours in chess,
Jeffery
________________________________________________________________
Jeffery A. Travelstead		traveja@wkuvx1.bitnet
----------------------------------------------------------------
From: ronb@cc.usu.edu
Newsgroups: rec.games.chess
Subject: How good is a 45000 rating??? |)
Date: 9 Nov 92 12:42:59 MDT
Organization: Utah State University

	People have been throwing around thier ratings on this newsgroup for
awhile, and I'm kind of curious as to how the system works.  If anyone has a
file that can explain it in fairly basic terms, could you mail it to me?

	 "Time well spent is a waste indeed."
		 sniggerfardimungus
	     	in%"ronb@cc.usu.edu"
	 The usual disclaimers apply anywhere 
              you can find a sticky spot.
From: riley@hotmetal.EBay.Sun.COM (Riley Hughes)
Newsgroups: rec.games.chess
Subject: Re: Looking for comprehensive chess books...
Date: 11 Nov 1992 17:31:32 GMT
Organization: Sun Microsystems
Distribution: world
Reply-To: riley@hotmetal.EBay.Sun.COM
NNTP-Posting-Host: hotmetal.ebay.sun.com


I strongly recommend Jeremy Silman's book Reassess your Chess.

My rating is currently 1796.  After studying this book I entered an Open this
weekend and promptly beat two experts and drew another, while my only loss
was to a Master (whom I blundered away a win in time pressure to).  

The key to this book is the teaching of the use of imbalances, such as

Material
Space
Pawn Structure
Superior Minor Piece
Initiative
Development
Control of Key Squares or Files

and one more possible imbalance I like to add to his list, King Safety.

Good Reading,
Riley Hughes





>In article <1992Nov10.033517.20738@sei.cmu.edu> wellerd@ajpo.sei.cmu.edu  
>(David Weller) writes:
>> I am looking for a decent book(s) on learning chess.  I'm quite the
>> patzer at the moment, and would like to have one or two books that
>> can bring my rating up above -120 :-)   So far, I've had two 
>> recommendations:
>> 
>> 	Comprehensive Chess Course (Vols I & II) 
>> 		Lew Alburt and Roman Pelts
>> 
>> 	The Road to Chess Mastery
>> 		Max Euwe
>> 
>> My (strong) preference is that these books be in algebraic notation.
>> 
>> Can anybody give comments on these (or other) books?
>> 
>> E-mail, Checks, or Money Orders gladly accepted :-)
From: linb@ucs.orst.edu (Benjamin Lin)
Newsgroups: rec.games.chess
Subject: Re: funky pairings
Date: 11 Nov 92 17:34:11 GMT
Article-I.D.: news.BxKBH0.8KF
Organization: University Computing Services - OSU

In article <1992Nov11.035859.9471@cis.uab.edu> sloan@cis.uab.edu (Kenneth Sloan) writes:
>Let's see - three players already had a bye, and thus at least 1 point.
>Of the others, only 1 other player could possibly have had a score of
>zero.  From the range of ratings you report, I suspect that there were
>no draws to complicate matters.  So...your bye sounds entirely plausible.
>
>No blunder here.
>
>Sounds like a fun tournament, though.  The pairings for the fourth and
>fifth rounds must have required considerable....creativity.
>

The FPB was given correctly, according to the rules.  I just feel that
the other players were screwed.  In these dinky tournaments where I live,
the players who get the HPB's and FPB's always seem to win the prize!

-benoni