HDTenEightyP/NetNews huggingface dataset:
From: sarge@cs.uq.oz.au (The Lemming)
Newsgroups: rec.puzzles
Subject: Re: Math Problem
Date: 8 Apr 92 05:10:41 GMT
Reply-To: sarge@cs.uq.oz.au

In <9204071337.AA25632@ucbvax.Berkeley.EDU> BANDA@AUSVM1.VNET.IBM.COM ("Venu Prabhakar Banda") writes:

>Problem: Show that (4444 ** 4444) is divisible by 9


I am assuming ** means to the power of.

4444 has the following prime factors
2*2*11*101

As none of these factors is 3, 
4444 ** anynumber

does not have 3 as a factor, and hence is not divisible by 9

The Lemming
--
-------------------------------------------------------------------------------
Leap before you look.                      sarge@cs.uq.oz.au
The Lemming.
------------------------------------------------------------------------------
Newsgroups: rec.puzzles,soc.culture.indian
From: hemmady@Cadence.COM (Shankar Hemmady)
Subject: A simple number puzzle
Organization: Cadence Design Systems, Inc.
Date: Tue, 7 Apr 1992 20:24:00 GMT


The puzzle goes as follows:

"My child's age raised to itself gives my age.
If my wife is younger than me by my child's age
and if we are LIVE humans, then what are our ages?"

a small clarification:  if my child's age is x,
then my age is x**x (x to the power of x)
And my wife is younger than me by x years.


- Shankar Hemmady
hemmady@cadence.com
From: ksc3@cunixa.cc.columbia.edu (Kyu sok  Cho)
Newsgroups: rec.puzzles
Subject: Re: Can I get the FAQ, please?
Keywords: neophyte
Date: 9 Apr 92 19:51:00 GMT
Article-I.D.: cunixf.1992Apr9.195100.15713
Reply-To: ksc3@cunixa.cc.columbia.edu (Kyu sok  Cho)
Organization: Columbia University

In article <16514@ulysses.att.com> tom@ulysses.att.com (Tom Smith) writes:
>I have seen many references to the FAQ list since I started
>reading this newsgroup a few days ago.  I requested riddle.p
>only to discover that only contains "situation puzzles."
>
>Can someone tell me where I can get a copy of the general
>FAQL, please?
>
>Thanks,
>Tom Smith.
>tom@ulysses.att.com

me too.
From: macster@IASTATE.EDU (Michael C Mccarty)
Subject: Re: wierd birthdays
Reply-To: macster@IASTATE.EDU (Michael C Mccarty)
Organization: Iowa State University
Date: Mon, 13 Apr 1992 07:45:53 GMT

In article <1992Apr10.173732.22043@fid.morgan.com>, sethb@fid.morgan.com (Seth
Breidbart) writes:
> In article <1992Apr10.151236.18195@clpd.kodak.com>
> benham@anion.serum.kodak.com (Todd Benham (x37354)) writes:
> >I am 15 minutes older than my twin brother (actually, I dont have a brother
> >but let's pretend) but according to our birth certificate's time of birth my
> >birthday comes one day after my twin brother's and
> >in different years.  How did this happen (and when are our birthdays)?
> 
> To have the birthdays on different dates is easy, even different
> years:  You were born towards the end of Dec. 31, your brother toward
> the beginning of Jan. 1.  But you're older, and your date of birth is
> later; therefore, your mother must have been on a ship crossing the
> International Date Line in between your births.
> 
> The simplest explanation is therefore a typo on your birth certificates.

Or, possibly, the birth certificates were switched at birth (who's to say it
couldn't happen?).

					Mike
Newsgroups: rec.puzzles
From: hemmady@Cadence.COM (Shankar Hemmady)
Subject: Re: A geometric puzzle (SPOILER)
Organization: Cadence Design Systems, Inc.
Date: Tue, 7 Apr 1992 20:17:28 GMT

In article <1992Apr2.153455.14788@odin.diku.dk> torbenm@diku.dk (Torben AEgidius Mogensen) writes:
>hemmady@Cadence.COM (Shankar Hemmady) writes:
>
>
>>You are given sixteen (16) points to be placed on a Euclidean
>>plane.
>
>>Place them in such a way that there are fifteen distinct lines which pass thru
>>these points.  Each of these 15 lines MUST have at least four of your points
>>on the line.
>
>>Clue:  The solution has some sort of symmetry assoicated with it. I also
>>believe that given the 16 points and the condition that at least four must be
>>on each line, you can have NO MORE THAN 15 lines.
>
>Solution:
>
>Draw a five-sided star. Inside the middle pentagon, draw another star
>with corners at the corners of the pentagon. Now place a point at each
>corner of the outermost star, at each corner of the innermost star
>(coinciding with the corners of the inner pentagon of the large star),
>at each corner of the pentagon inside the inner star and finally in
>the center of the figure. Each of the ten lines forming the two stars
>will pass through four points, as will the five lines connecting a
>corner of the outermost star with the opposite corner of the innermost
>star. I will not attempt to draw this using ascii ;-)
>
>	Torben Mogensen (torbenm@diku.dk)


Interestingly, the five-sided star need NOT be a symmetric or regular
one.  It will work even if the star has sides of different length!

I think this is a property similar to that in triangles, where we have circumcenter,
incenter etc, where irrespective of the regularity of the original triangle we end up 
at one point (Ofcourse the point will be different unless the traingle 
is equilateral)

-Shankar Hemmady
hemmady@cadence.com


Newsgroups: rec.puzzles
From: hemmady@Cadence.COM (Shankar Hemmady)
Subject: The negative Harmonic series
Organization: Cadence Design Systems, Inc.
Date: Sat, 11 Apr 1992 02:05:21 GMT



The series that David G. Caraballo refers to is the well-known
harmonic series with alternately positive and negative terms.

It has puzzled mathematicians for a long time.

It satisfies the rules of convergence, but not those of absolute
convergence.

So here is a puzzle on that subject.  (David please do not answer this
one)

	1 - 1/2 + 1/3 - 1/4 + 1/5 - 1/6 + 1/7 - 1/8 ....

   =	1 - (2/2-1/2) + 1/3 - (2/4-1/4) + 1/5 - (2/6-1/6) + 1/7 - (2/8-1/8) ....

	expanding the brackets and re-grouping ...

   = 	(1 + 1/2 + 1/3 + 1/4 + 1/5 + 1/6 + 1/7 + 1/8 + ...)
	- (2/2 + 2/4 + 2/6 + 2/8 + ...)

	factorizing ther 2/2, 2/4, etc ...

   = 	(1 + 1/2 + 1/3 + 1/4 + 1/5 + 1/6 + 1/7 + 1/8 + ...)
     	- (1 + 1/2 + 1/3 + 1/4 + ...)

   =    ZERO!!


What went wrong.  I know that there is the Absolute Convergence theorem which
can find the error in the above statements.  But can you give a 
simple lay-man explanantion of the fallacy?


-Shankar Hemmady
hemmady@cadence.com
(408)987-5214

Newsgroups: rec.puzzles
From: james@crc.ricoh.com (James Allen)
Subject: Re: Math Problem
Organization: RICOH California Research Center
Date: Wed, 8 Apr 92 02:04:52 GMT

In <9204071337.AA25632@ucbvax.Berkeley.EDU>
	BANDA@AUSVM1.VNET.IBM.COM ("Venu Prabhakar Banda") writes:
> Problem: Show that (4444 ** 4444) is divisible by 9

	As others have pointed out, this will be very difficult to show.

	The same large number appears in a math contest problem from 1975.
	(the Hungarian math contest? or the Putnam?)

	Find
		sod ( sod ( sod (4444 ^ 4444 ) ) )

	where sod (x) is the sum of the digits in the decimal
	representation of x.
> 
> Cheers,
> Venu

James
From: courtes@corvette.ens.fr (Francois Courtes)
Newsgroups: rec.puzzles
Subject: Re: order of numbers?
Date: 7 Apr 92 21:41:33 GMT
Distribution: rec
Organization: Ecole Normale Superieure, PARIS, France

In article <1992Apr6.190547.27198@Princeton.EDU> pfalstad@phoenix.Princeton.EDU (Paul Falstad) writes:
>
>>	8, 3, 1, 5, 9, 7, 6, 4, 2
>
>I'll guess German, based on where the "2" is.
>

Shouldn't it be 8, 3, 1, 5, 9, 6, 7, 4, 2 ?

F.C.
Newsgroups: rec.puzzles
From: djoyce@black.clarku.edu (Dave Joyce)
Subject: Re: trvia (alternative spoiler)
Organization: Clark University (Worcester, MA)
Date: 15 Apr 92 00:32:17 GMT

In <1992Apr13.235520.9954@athena.mit.edu> uge@athena.mit.edu (Eugene A Beidl) writes:

>In article <djoyce.703038701@black.clarku.edu>, djoyce@black.clarku.edu (Dave Joyce) writes:
>|> In <703024532.1@nwark.FidoNet> Marc.Costaldi@f2050.n391.z1.FidoNet.Org (Marc Costaldi) writes:
>|> 
>|> >Got a problem need some help with:
>|> >
>|> >An architect was asked to design a square house with the window in each
>|> >wall 
>|> >having a southern exposure. How was this done?
>|> 
>|> Alternative spoiler:
>|> Let's see now.  Suppose there was only one wall having a southern exposure.
>|> Then the architect would only have to put a window in that wall.  So,
>|> he/she would design a square house with no windows on the north, east, or
>|> west walls, but one window on the south wall.  That explains why the
>|> problem refers to "the" window: there only is one window.
>
>I disagree.  The problem refers to "the window" in EACH wall.  Thus each wall
>has only one window.  I believe the other answer is the only correct one.

Read it again.  It says "with the window in each wall having a southern
exposure."  There is only one wall having a southern exposure.

-- 
David E. Joyce				Dept. Math. & Comp. Sci.
Internet:  djoyce@black.clarku.edu	Clark University
BITnet:    djoyce@clarku		Worcester, MA 01610-1477
Newsgroups: rec.puzzles
From: tolman%asylum.utah.edu@cs.utah.edu (Kenneth Tolman)
Subject: Number puzzle (dollars per hour)
Date: 11 Apr 92 17:35:33 MDT
Organization: University of Utah CS Dept


This is a number puzzle, if this is inappropriate here, please tell me.  It
is not fun unless you do it YOURSELF with your own values.

How much is your life worth per hour?



(A SOLUTION LIES AHEAD, BUT FEEL FREE TO DO IT DIFFERENTLY)



















Put it this way, if someone offered you XXX dollars to die in five years, how
much money would this have to be for you to consider it?  They pay you now,
and you must die in five years.

Would they have to pay you a million bucks?  Too little?
Five million?  A Trillion?

If any of the above was too small, you are "priceless" use 5 million 
dollars as XXX dollars.  (as a lower bound)

Now estimate how many more years you have to live: YEARS   (72-age is good)

Now do this:

YEARS * 365 * 24 = HOURS_LEFT

To find dollars per hour:

XXX dollars / HOURS_LEFT = WORTH

That number is how much you are worth to yourself per hour (including while
you are asleep!)  Knowing this, consider what you are being paid at your job,
and whether you enjoy it.  You are paying yourself this much to live your
own life, are you a good boss?
Newsgroups: rec.puzzles
From: jwd2@arcadien.owlnet.rice.edu (Joseph William DeVincentis)
Subject: Re: Brick Problem (crude ASCII)
Keywords: brick, graphical, puzzle
Organization: Rice University
Date: Mon, 6 Apr 1992 18:16:45 GMT

In article <orange.702580580@cunews>, orange@alfred.carleton.ca (Paul Vallee) writes:
> The object is to draw a curvilinear line through every wall of every
> brick, without going through any given wall more than *once*.
> Note:  Bricks in the middle row have *six* walls, ok?  I can't think
> of a better way to describe this.  Center bricks on the top and bottom
> rows have *five* walls. 
>      a    b     c
>   |----|-----|----|
> d |  e |  f  |  g | h
>   |----|--|--|----|
> i |   j   |    k  | l
>   |----|--|--|----|
> m |  n |  o  |  p | q
>   |----|-----|----|
>      r    s     t

SPOILERS


The key is noticing that there are two odd vertices (the two bricks
with five walls). You must start and end in these two bricks, since, for
any brick which you start outside and end outside, you must pass through
its walls an even number of times.
So one solution is fjosrnjeadefghlkjimnopqtpkgcbfko



> 
> Same problem, different brick layout... 
>       a       b
>   |-------|-------|
> c |   d   |   e   | f
>   |----|--|--|----|
> g |  h |  i  |  j | k
>   |----|-----|----|
> l |   m   |   n   | o
>   |-------|-------|
>       p       q

More SPOILERS


The second version is unsolvable because there are FOUR odd vertices,
d, e, m, and n. This of course assumes you don't allow any tricks like
going through corners or along an edge.

-- 
\  ,------------------------------------------------------------.  /
 \/     Joseph  De Vincentis            jwd2@owlnet.rice.edu     \/
 /\           Help! My .sig just flipped umop-ap!sdn !           /\
/  `------------------------------------------------------------'  \
From: jerryd@hpgrla.gr.hp.com (Jerry Donovan)
Date: Thu, 9 Apr 1992 14:18:06 GMT
Subject: Re: Re: Dying young (solved)
Organization: Hewlett-Packard, Greeley, CO
Newsgroups: rec.puzzles

>>You are put in a room by evil Nazi's.  There is a button in front of you.  If
>> ...
>>It is now 11:50. What do you do?

>Eduacated by Lei-Feng's (a hero in China) self-sacrifice spirit, I 
>would press the button as earlier as possible, to save more people :^))  

>-Hong, CIS Dept, U of Penn

I like this honorable and pure motive.  It also is possible that given the
situation that the truth of the experiment was not revealed to the
participants.  All these people trying to calculate odds and such are 
forgetting the human element.   The odds that the truth was given is very 
low in this situation.  

Jerry Donovan
From: warwick@cs.uq.oz.au (Warwick Allison)
Newsgroups: rec.puzzles
Subject: Re: Dying young (solved)
Date: 8 Apr 92 00:24:24 GMT
Reply-To: warwick@cs.uq.oz.au

farrell@coral.cs.jcu.edu.au (John Farrell) writes:

>warwick@cs.uq.oz.au (Warwick Allison) writes:

>  Indeed. The more Ws there are, the better it is to be a J! Are you trying to
>insinuate that by being a nice guy, I encourage other people to be nice guys,
>and hence improve the chances that someone else is nice first? Great idea, as
>long as we had time to arrange it before the bloody Nazis got us!

Hurry, be a Nice Guy (tm), the end is nigh!!

>It is not the survival of thousands of Js I am worried about, just
>this one! 

Okay, then how does the puzzle change if all of the 100 people are
members of your family (4 brothers, 5 sisters, 2 parents, 4 uncles,
6 aunts, 30 cousins, 4 sons, 5 daughters, 19 granddaughters and
20 grandsons).

Hope that one of your parents presses the button, even though they are
expecting your terminally ill cousin to press it?  Gets complex once
you know them.  How about we wire one up in this Computer Science
building and just see what happens.  I've got my dice.


Warwick
--
  _-_|\      warwick@cs.uq.oz.au            / eastings genistas /
 /     * <-- Computer Science Department,  / giantess seatings /
 \_.-._/     University of Queensland,    / teasings tsiganes /
      v      Brisbane, Australia.        / -------- -------- /
From: hxie@grad1.cis.upenn.edu (Hong Liang Xie)
Newsgroups: rec.puzzles
Subject: Re: More Math Problems
Date: 8 Apr 92 22:01:25 GMT
Organization: University of Pennsylvania

In article <9204081953.AA09310@ucbvax.Berkeley.EDU> BANDA@AUSVM1.VNET.IBM.COM ("Venu Prabhakar Banda") writes:
>Hi Folks,
>
>  Here are some more interesting math problems. Hopefully they are
>all new to this newsgroup (at least I have not seen these in the
>last year).....
>
>1. Show that (2222^5555 + 5555^2222) is divisible by 7?
>   (No, I have not made any mistake and yes "^" is the symbol
>    for exponentiation). This was actually given to us in high
>    school back in India (Not a very difficult problem, but we
>    could not solve it then. After looking at the solution, I must
>    add that it is not a very difficult problem, requiring very
>    elementary knowledge of mathematics)


A series of calculations can solve this problem easily.


(2222^5555 + 5555^2222) mod 7
	= ((317x7+3)^5555 + (793x7+4)^2222) mod 7
	= (       3 ^5555 +        4 ^2222) mod 7
	= (     243 ^1111 +       16 ^1111) mod 7
	= (( 34x7+5)^1111 + (  2x7+2)^1111) mod 7
	= (       5 ^1111 +        2 ^1111) mod 7
	= (5+2)(...) mod 7
	= 0  

I think this brutal force method can solve lots of similar
problems.

-Hong, CIS Dept, U of Penn
From: mdeboer@fwi.uva.nl (Marc de Boer (I88))
Newsgroups: rec.puzzles
Subject: C-puzzle (Tough)
Summary: Tricky C-programs; what do they do?
Keywords: puzzle
Date: 7 Apr 92 12:54:12 GMT
Organization: FWI, University of Amsterdam

Ok, smart dudes! Here are some mean, MEAN c programs!

Question: figure out what they do! And how do they do it?
Try to predict a few. Don't give up soon!

They should compile under unix (cc).
I haven't tried Turbo C, but it should be possible.

#include <stdio.h>
int Oo[1000],*O=Oo;main(o,O0)char**O0;{if(--o!=!0){*++O=atoi(*++O0);*++O= atoi(*++O0);for(O--;O!=Oo;){for(o=Oo-O;o;printf("F(%d,",O[++o]));printf( "%d",O[++o]);while(printf("%c",*(")\n"+(--o==Oo-O))),o!=Oo-O);(*O)?(*++O? ((*(O--))--,(*(O++))--,(*(O+!0)=*O),(*O=*(O-!!!0)+!0)):((*O)++,(*(--O))--)):((*O=*(O+!0)+!!!0),*(O --));}printf("%d\n",*++O);}}


main(o,O0)char**O0;{int OO,O;O=--o?atoi(O0[!0]):! 0;for(o=((OO=O*O)-O+!0+!0)>>!0;OO;o+=((--OO%O)?-! 0:((((o-!0)%O)?O:0)+!0))-(((o-!0)%O)?O:0)){printf ("\n%*d "+!!(OO%O),!0<<!0<<!0,o+=(o<!0)?O*O:0);}}

Good luck!


--------------------------------------------------------------------
Thanx for you input!                                   Marc de Boer
(/dev/null loved it!)                           (mdeboer@fwi.uva.nl)
--------------------------------------------------------------------

-- 
--------------------------------------------------------------------
Thanx for you input!                                   Marc de Boer
(/dev/null loved it!)                           (mdeboer@fwi.uva.nl)
--------------------------------------------------------------------
From: paulsen@stipple.seas.upenn.edu (Brian Paulsen )
Newsgroups: rec.games.chess
Subject: Reinfeld's Win At Chess
Date: 13 Apr 92 16:31:07 GMT
Followup-To: gnu.chess
Organization: University of Pennsylvania

My senior project involves making a chess computer.  I am using an algorithm
that is different than the standard alpha-beta search.  To provide test
statistics, I would like to have the program try the 300 positions in Win At
Chess.  If anybody has these positions on disk, could you please send a tarred
file to me.  Also, please tell me how the board position should be read in.

Thanks in advance,
paulsen@eniac.seas.upenn.edu


Newsgroups: rec.games.chess
From: clinton.wall@matrix.sbs.com (Clinton Wall) 
Newsgroups: rec.games.chess
Subject: e-mail game anyone?
Date: 5 Apr 92 05:38:00 GMT
Distribution: world
Organization: The MATRIX BBS - Birmingham, AL - 205-323-2016
Reply-To: clinton.wall@matrix.sbs.com (Clinton Wall) 

To: p0001@vax1.mankato.msus.edu

P >I am interested in playing chess e-mail against anyone (any class).
  >I have been playing for about fifteen years, but have not played in a
  >tournament in the last three years.  Class C or B would be ideal.
  >If interested, please write to:

P >p0001@vax1.mankato.msus.edu

  Paul:

  I'm always ready. Take your pick of one or both. At present,
  I am awaiting a reply to my USCF membership application.
  Rating doesn't mean a lot to me at the moment.

  Game 1: 1. d4  ???
  Game 2: 1. ???

  Clinton.     Clinton.Wall@Matrix.sbs.com
From: jrb@Ingres.COM (John Black)
Newsgroups: rec.games.chess
Subject: A sad loss for the chess community: Sammy Reshevsky
Date: 7 Apr 92 18:53:01 GMT
Reply-To: jrb@Ingres.COM (John Black)
Organization: Ask Computer Systems Inc., Ingres Division, Alameda CA 94501

Here is an obit from today's Chronicle (taken from the NY Times):


Suffern, N.Y.

Samuel Reshevsky, the Polish-born chess prodigy and GM who astounded the world
with his feats as a boy and dominated American chess for nearly four decades,
died Saturday of a heart attack at age 80.

As a child, he dazzled the capitals and courts of Europe, then arrived in N.Y.
with his family at age 8 and amazed Americans with triumphant coast-to-coast
tours, taking on and setting down 40 to 75 opponents at a time.

As an adult, he won the US championship seven times, scored spectacular
victories in international tournaments and defeated many of the world's top
players, including Jose Raoul Capablanca in 1935 and Mikhail Botvinnik, the
reigning world champion, in 1955.

Mr. Reshevsky was the top name in American chess until 1958, when 14-year-old
Bobby Fischer won the US championship.  From then on, he played with diminishing
frequency and success in major tournaments, making his living as an investment 
analyst and insurance salesman.

He won his last US championship in 1971 at age 59.  In 1981, he was a finalist
among Americans seeking to qualify for the world championship matches.  In 1984,
he tied for 1st place in the Reykjavik International Tournament, his last
world-class showing.
From: karlth@rhi.hi.is (Karl Thoroddsen)
Newsgroups: rec.games.chess
Subject: Chessmaster 3000 for Windows. Info needed
Date: 8 Apr 92 10:15:13 GMT


How good is it?

	-	Speed?
	-	Features?
	-	Compatible with 3.1?
	-	Graphics?

Thanks in advance.


--

\Internet:     karlth@rhi.hi.is         \ Karl Thoroddsen University Of Iceland
  \  UUCP:     ..!mcvax!hafro!rhi!karlth  \      Department Of Computer Science
From: DCBCS@CANAL.CRC.UNO.EDU (Dennis Baker)
Newsgroups: rec.games.chess
Subject: BCE
Date: 7 Apr 92 14:32:00 GMT
Article-I.D.: canal.01GIK5IYD5LG8X303H

I meant to say Rousselle was a Basic Chess Endings fanatic in my
previous post (Fine's book).

Dennis Baker
<DCBCS@uno.edu>
From: DCBCS@CANAL.CRC.UNO.EDU (Dennis Baker)
Newsgroups: rec.games.chess
Subject: Sticking to your principles
Date: 11 Apr 92 14:37:00 GMT

I just saw a post where Samuel Reshevsky was admired for "sticking
to his principles" and not playing chess on Friday nights and 
Saturdays, due to his being an Orthodox Jew or something.

I believe Bobby Fischer also "stuck to his principles" when he followed
the observances of that nut group he was in -- what, the "Church of the
Air" or something -- and refused to play on certain days.  Since he later
had a falling out with this group, I'm confused about whether to admire
this anymore, this "sticking to your principles" thing.  Actually I'm not
confused at all.  We might say Fischer's refusal to play on such and such
a day or days was all for naught.  Much ado about nothing.

The IRA just set off two more car bombs -- should we admire this act of
"sticking to their principles?"

I admire Reshevsky for his great chess career, although I hear his
personality left a lot to be desired -- now THIS I'd like to hear about.
Anybody know anything of this "nasty personality" side of Reshevsky?
Forgive me if I've been misinformed.

Dennis Baker
<DCBCS@uno.edu>
From: gilmozzi@stsci.edu (Roberto Gilmozzi)
Newsgroups: rec.games.chess
Subject: Re: Reinfeld Take 3
Date: 9 Apr 92 03:45:58 GMT
Organization: Space Telescope Science Institute

>In article <Apr.8.21.49.56.1992.13722@remus.rutgers.edu> 
>clong@remus.rutgers.edu (Chris Long) writes:
>
>White to play and mate (1001 BWC, #95):
>
>         8 r - b - q b - r
>         7 - p - - - - p p
>         6 p n - P - n - -
>         5 - - - - N - - k
>         4 - - - - - - - -
>         3 - Q - - - - - -
>         2 P P - - N P P P
>         1 R - B - - R K -
>           a b c d e f g h
>
>Reinfeld gives a mate in 4 via a queen sacrifice.  Mate Black in 3
>without moving the queen.
>-- 

1. Ng3+ Kh4
2. Nf3+ Kg4
3. h3#

But in real games (as opposed to problems) does it really matter
if you take an extra move to win?

Roberto (gilmozzi@ststci.edu)
Newsgroups: rec.games.chess
From: linb@UCS.ORST.EDU (Benjamin Lin)
Newsgroups: rec.games.chess
Subject: Re: Looking for improvement suggestions
Date: 9 Apr 92 15:53:12 GMT
Article-I.D.: talon.1992Apr9.155312.14975
Organization: University Computing Services - OSU

I used to be a 'C' player and now I'm a 'B' player.  Speaking from
my own experience, class players generally aren't very good at all.
Even though my rating has gone up, I don't think I've gotten any better.
If anything, I'm worse now than I used to be when I was rated 1500.
The only reason that my rating went up was that I played in tournaments.
Once you get used to playing in tournaments, you should be able to 
give a good game against any class 'B' player, even if your rating is
below 1000.  Just play carefully and slowly.
About openings, don't bother to memorize any.  Just develop pieces
as quickly as possible.  If you play book openings, you will just
reach a position that your more experieced opponents knows much better.
Basically, the best way to improve is to play in a lot of tournaments!
Newsgroups: rec.games.chess