Please turn on javascript in your browser to play chess.
Only Chess Forum
on the payroll
Joined 26 Nov '04 Moves 155080 Originally posted by RBHILL
2 engine uses so far have given my post thumbs down. RB, you wouldn't know a cheater if he forked all your pieces in a single move.
Edit: construction challenge. Make a position where no enemy pieces are attacked, and the side to move can make a move that attacks all 16 [or as many as possible].
California
Joined 21 May '03 Moves 227331 Originally posted by MyFinestSuit
Yep, only cheaters have time to chat...
.....
.......
so, favorite icecream flavor, anyone? ? ? 😉 Rite aid's/Thrifty's: chocolate malted crunch.
https://www.google.com/search?site=&source=hp&ei=geGJU_q2IoHyoASmloHgBg&q=chocolate+malted+crunch+ice+cream&oq=chocolate+malted&gs_l=mobile-gws-hp.1.1.0l5.3679.17678.0.19424.19.18.1.11.11.0.877.6433.0j2j9j2j2j2j1.18.0....0...1c.1.45.mobile-gws-hp..0.19.3163.3.opRvf-1nPeY#facrc=_&imgrc=67mFQ8MzmXk1sM%253A%3Bundefined%3Bhttp%253A%252F%252Fs3-media2.ak.yelpcdn.com%252Fbphoto%252Fn8Ea24rk2_z3hS2cYdQaDQ%252Fl.jpg%3Bhttp%253A%252F%252Fwww.yelp.com%252Fbiz_photos%252Fthrifty-ice-cream-henderson%253Fselect%253Dn8Ea24rk2_z3hS2cYdQaDQ%3B300%3B400
223b Baker Street
Joined 25 Apr '06 Moves 33101 Are you going for the World Record for number of feet in the mouth at the same time ?
under your bed
Joined 10 Nov '10 Moves 22480 No one cares - we're all patzers anyway so get over it.
Linkenheim
Joined 22 Apr '05 Moves 654938 Originally posted by BigDoggProblem
RB, you wouldn't know a cheater if he forked all your pieces in a single move.
Edit: construction challenge. Make a position where no enemy pieces are attacked, and the side to move can make a move that attacks all 16 [or as many as possible].
Joined 08 Apr '09 Moves 19506 Originally posted by Ponderable
[fen] 1Q1K4/R3R3/2n5/N1PBN3/1B6/3rb3/8/8 - 0 1[/fen] 1 more.
[FEN "1Q1K4/R3R3/8/N1PBN3/1BPn3r/3rb3/8/k7 b - - 0 1"] {No white pieces attacked} Nc6+ { 10 pieces attacked. This is probably the maximum.}
Milwaukee, WI
Joined 11 Dec '10 Moves 16731 Maybe add a Q to a1 and put K on a2.
Joined 10 Apr '14 Moves 273 Originally posted by tvochess
1 more.
[pgn]
[FEN "1Q1K4/R3R3/8/N1PBN3/1BPn3r/3rb3/8/k7 b - - 0 1"]
{No white pieces attacked} Nc6+ { 10 pieces attacked. This is probably the maximum.}
[/pgn] That can't be the maximum. There is another dark square diagonal that is not being utilized.
Linkenheim
Joined 22 Apr '05 Moves 654938 Originally posted by iChopWoodForFree
That can't be the maximum. There is another dark square diagonal that is not being utilized. It is already under attack from the Knight...
Joined 08 Apr '09 Moves 19506 Originally posted by Ponderable
It is already under attack from the Knight... indeed
RHP Arms
Joined 09 Jun '07 Moves 48793 Construct a position where with one move 6 pieces are attacked.
(There being none attacked before the move)
... without using a knight!
on the payroll
Joined 26 Nov '04 Moves 155080 Originally posted by wolfgang59
Construct a position where with one move 6 pieces are attacked.
(There being none attacked before the move)
... without using a knight!
[Event "?"] [Site "?"] [Date "????.??.??"] [Round "?"] [White "New game"] [Black "?"] [Result "*"] [SetUp "1"] [FEN "8/8/2p3p1/8/2k3p1/8/2p3p1/K3Q3 w - - 0 1"] [PlyCount "1"] 1. Qe4 *
Joined 08 Apr '09 Moves 19506 Originally posted by wolfgang59
Construct a position where with one move 6 pieces are attacked.
(There being none attacked before the move)
... without using a knight! This is also 6, of which one pawn twice!
[FEN "4k3/1p1p1pp1/3p4/R2Pp2p/8/8/3R3B/Q3K2B w - e6 0 0"] 1. d5xe6
on the payroll
Joined 26 Nov '04 Moves 155080 Originally posted by tvochess
This is also 6, of which one pawn twice! [pgn]
[FEN "4k3/1p1p1pp1/3p4/R2Pp2p/8/8/3R3B/Q3K2B w - e6 0 0"]
1. d5xe6
[/pgn] One could argue that Pe5 is under attack in the diagram, though. 🙂
Joined 08 Apr '09 Moves 19506 The pawn on e5 is the seventh on the board, so is not included in my count.
Cookies help us deliver our Services. By using our Services or clicking I agree, you agree to our use of cookies. Learn More . I Agree